Disconnected forbidden subgraphs, toughness and Hamilton cycles

DOI10.1155/2013/673971zbMath1264.05080arXiv1207.5132OpenAlexW2091268837WikidataQ58998267 ScholiaQ58998267MaRDI QIDQ1952726

Zh. G. Nikoghosyan

Publication date: 3 June 2013

Published in: ISRN Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1207.5132

zbMATH Keywords

Hamiltonian cyclesforbidden subgraphsconnectivity conditionssingle forbidden connected subgraph

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)

Related Items (9)

On hamiltonicity of 1-tough triangle-free graphs ⋮ Forbidden subgraphs for Hamiltonicity of 1-tough graphs ⋮ A note on Hamiltonian cycles in 4-tough \((P_2 \cup KP_1)\)-free graphs ⋮ Some conditions for Hamiltonian cycles in 1-tough \((K_2 \cup kK_1)\)-free graphs ⋮ Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs ⋮ Toughness, forbidden subgraphs and pancyclicity ⋮ Disconnected forbidden pairs force supereulerian graphs to be Hamiltonian ⋮ Implementation of RTO in a large hydrogen network considering uncertainty ⋮ Toughness, forbidden subgraphs, and Hamilton-connected graphs

Cites Work

• Unnamed Item
• Characterizing forbidden pairs for hamiltonian properties
• Sufficient conditions for a graph to be Hamiltonian

This page was built for publication: Disconnected forbidden subgraphs, toughness and Hamilton cycles