Forbidden subgraphs for existences of (connected) 2-factors of a graph

DOI10.7151/dmgt.2366zbMath1505.05101OpenAlexW4247767215MaRDI QIDQ2107755

Xiaojing Yang, Limning Xiong

Publication date: 2 December 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2366

zbMATH Keywords

2-factorHamiltonian graphsforbidden subgrapheven factor

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Forbidden subgraphs for graphs with (near) perfect matching to be hamiltonian

Cites Work

• Unnamed Item
• Unnamed Item
• The edge Hamiltonian path problem is NP-complete
• Characterizing forbidden pairs for hamiltonian properties
• Forbidden subgraphs for supereulerian and Hamiltonian graphs
• Forbidden subgraphs that imply 2-factors
• A Pair of Forbidden Subgraphs and 2-Factors
• On the Computational Complexity of Combinatorial Problems
• Reducibility among Combinatorial Problems
• An algorithmic proof of Tutte's f-factor theorem

This page was built for publication: Forbidden subgraphs for existences of (connected) 2-factors of a graph