Forbidden subgraphs for Hamiltonicity of 1-tough graphs

DOI10.7151/DMGT.1897MaRDI QIDQ339484zbMATH OpenOpenAlexFDO

Authors Binlong Li, Hajo Broersma, Shenggui Zhang

Publication date 11 November 2016

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

Hamiltonian graphforbidden subgraph\(H\)-free graph1-tough graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• scientific article; zbMATH DE number 861334
• Disconnected forbidden subgraphs, toughness and Hamilton cycles
• Toughness, forbidden subgraphs, and Hamilton-connected graphs
• On hamiltonicity of 1-tough triangle-free graphs
• A note on Hamiltonian cycles in 4-tough \((P_2 \cup KP_1)\)-free graphs

Cites work

• Characterizing forbidden pairs for hamiltonian properties
• Disconnected forbidden subgraphs, toughness and Hamilton cycles
• Graph theory
• Hamiltonian results inK1,3-free graphs
• Long cycles in graphs with prescribed toughness and minimum degree
• Not every 2-tough graph is Hamiltonian
• On a class of posets and the corresponding comparability graphs
• On some intriguing problems in Hamiltonian graph theory---a survey
• On toughness and Hamiltonicity of \(2K_{2}\)-free graphs
• Tough graphs and Hamiltonian circuits.
• Toughness in graphs -- a survey

Cited in

(17)

• scientific article; zbMATH DE number 4137803 (Why is no real title available?)
• Forbidden pairs of disconnected graphs implying Hamiltonicity
• A Fan-type condition for cycles in 1-tough and k-connected (P₂ kP₁)-free graphs
• On hamiltonicity of 1-tough triangle-free graphs
• Some conditions for Hamiltonian cycles in 1-tough \((K_2 \cup kK_1)\)-free graphs
• scientific article; zbMATH DE number 57115 (Why is no real title available?)
• Hamiltonicity of 1-tough \((P_2 \cup KP_1)\)-free graphs
• Toughness, forbidden subgraphs and pancyclicity
• Toughness, forbidden subgraphs, and Hamilton-connected graphs
• 10-tough chordal graphs are Hamiltonian
• A note on Hamiltonian cycles in 4-tough \((P_2 \cup KP_1)\)-free graphs
• Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs
• Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs I: Nets and bulls
• Hamiltonian cycles and tight cutsets
• More relations between \(\lambda \)-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
• Disconnected forbidden subgraphs, toughness and Hamilton cycles
• Forbidden Induced Subgraphs for Toughness

This page was built for publication: Forbidden subgraphs for Hamiltonicity of 1-tough graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339484)