Toughness, forbidden subgraphs and pancyclicity

DOI10.1007/s00373-021-02284-yzbMath1470.05092OpenAlexW3132832720MaRDI QIDQ2045380

Li-Gong Wang, Wei Zheng, Hajo J. Broersma

Publication date: 12 August 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02284-y

zbMATH Keywords

Hamiltonian graphtoughnessforbidden subgraphpancyclic graph

Mathematics Subject Classification ID

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

Cites Work

• Forbidden subgraphs for Hamiltonicity of 1-tough graphs
• Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability
• Extending cycles in graphs
• On a class of posets and the corresponding comparability graphs
• Characterizing forbidden pairs for hamiltonian properties
• Toughness, hamiltonicity and split graphs
• Disconnected forbidden subgraphs, toughness and Hamilton cycles
• Structural properties and hamiltonicity of neighborhood graphs
• Not every 2-tough graph is Hamiltonian
• Toughness, forbidden subgraphs, and Hamilton-connected graphs
• Note on the perfect Roman domination number of graphs
• Toughness in graphs -- a survey
• Tough graphs and Hamiltonian circuits.
• Hamiltonian results inK1,3-free graphs
• Toughness, minimum degree, and the existence of 2‐factors
• On Toughness and Hamiltonicity of 2K₂‐Free Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Toughness, forbidden subgraphs and pancyclicity