Forbidden pairs of disconnected graphs for 2‐factor of connected graphs

DOI10.1002/jgt.22773zbMath1522.05251OpenAlexW4200189165MaRDI QIDQ6081558

Zdeněk Ryjáček, Petr Vrána, Přemysl Holub, Shipeng Wang, Limning Xiong

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22773

zbMATH Keywords

2-factorclosureforbidden subgraphdisconnected graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Forbidden pairs of disconnected graphs for supereulerianity of connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Forbidden subgraphs, hamiltonicity and closure in claw-free graphs
• On a closure concept in claw-free graphs
• Characterizing forbidden pairs for hamiltonian properties
• The local structure of claw-free graphs without induced generalized bulls
• Forbidden subgraphs that imply 2-factors
• A note on Hamiltonian circuits
• A Pair of Forbidden Subgraphs and 2-Factors
• Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity
• Closure, 2-factors, and cycle coverings in claw-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs