Forbidden subgraphs for existences of (connected) 2-factors of a graph
Discussiones Mathematicae. Graph Theory, Tome 43 (2023) no. 1, pp. 211-224
Voir la notice de l'article provenant de la source Library of Science
Clearly, having a 2-factor in a graph is a necessary condition for a graph to be hamiltonian, while having an even factor in graph is a necessary condition for a graph to have a 2-factor. In this paper, we completely characterize the forbidden subgraph and pairs of forbidden subgraphs that force a 2-connected graph admitting a 2-factor (a necessary condition) to be hamiltonian and a connected graph with an even factor (a necessary condition) to have a 2-factor, respectively. Our results show that these pairs of forbidden subgraphs become wider than those in Faudree, Gould and in Fujisawa, Saito, respectively, if we impose the two necessary conditions, respectively.
Keywords:
forbidden subgraph, even factor, 2-factor, hamiltonian
@article{DMGT_2023_43_1_a13,
author = {Yang, Xiaojing and Xiong, Liming},
title = {Forbidden subgraphs for existences of (connected) 2-factors of a graph},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {211--224},
publisher = {mathdoc},
volume = {43},
number = {1},
year = {2023},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2023_43_1_a13/}
}
TY - JOUR AU - Yang, Xiaojing AU - Xiong, Liming TI - Forbidden subgraphs for existences of (connected) 2-factors of a graph JO - Discussiones Mathematicae. Graph Theory PY - 2023 SP - 211 EP - 224 VL - 43 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DMGT_2023_43_1_a13/ LA - en ID - DMGT_2023_43_1_a13 ER -
Yang, Xiaojing; Xiong, Liming. Forbidden subgraphs for existences of (connected) 2-factors of a graph. Discussiones Mathematicae. Graph Theory, Tome 43 (2023) no. 1, pp. 211-224. http://geodesic.mathdoc.fr/item/DMGT_2023_43_1_a13/