Disconnected forbidden pairs force supereulerian graphs to be Hamiltonian

DOI10.1016/j.disc.2024.114301MaRDI QIDQ6646420

Limning Xiong, Qiang Wang

Publication date: 2 December 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian graphsforbidden subgraphsupereulerian graphsdisconnected subgraph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Characterizing forbidden pairs for hamiltonian properties
• Disconnected forbidden subgraphs, toughness and Hamilton cycles
• Forbidden subgraphs for supereulerian and Hamiltonian graphs
• A note on Hamiltonian circuits
• Forbidden Pairs of Disconnected Graphs Implying Hamiltonicity
• Forbidden pairs of disconnected graphs for supereulerianity of connected graphs
• Forbidden pairs of disconnected graphs for 2‐factor of connected graphs

This page was built for publication: Disconnected forbidden pairs force supereulerian graphs to be Hamiltonian