Forbidden subgraphs and Hamiltonian properties and graphs

DOI10.1016/0012-365X(82)90216-3zbMath0495.05039MaRDI QIDQ1169479

Michael S. Jacobson, Ronald J. Gould

Publication date: 1982

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

zbMATH Keywords

forbidden subgraphspancyclic graphhomogeneously traceable

Mathematics Subject Classification ID

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

Related Items (30)

A Pair of Forbidden Subgraphs and 2-Factors ⋮ Heavy subgraphs, stability and Hamiltonicity ⋮ Nowhere-zero 3-flows and \(Z_3\)-connectivity of graphs without two forbidden subgraphs ⋮ Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs ⋮ Claw-free graphs---a survey ⋮ Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs ⋮ Dominating cycles and forbidden pairs containing \(P_5\) ⋮ Characterizing forbidden pairs for hamiltonian properties ⋮ Forbidden subgraphs for chorded pancyclicity ⋮ Quasi-claw-free graphs ⋮ Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian ⋮ 2-Trees: Structural insights and the study of Hamiltonian paths ⋮ Forbidding and enforcing on graphs ⋮ Closure and forbidden pairs for Hamiltonicity ⋮ On 2-factors with a bounded number of odd components ⋮ On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs ⋮ Hamiltonicity in claw-free graphs ⋮ Forbidden pairs for spanning (closed) trails ⋮ Closure and forbidden pairs for 2-factors ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions ⋮ Fan's condition on induced subgraphs for circumference and pancyclicity ⋮ Hamilton circuits and essential girth of claw free graphs ⋮ Forbidden pairs and the existence of a dominating cycle ⋮ Extending cycles in graphs ⋮ Forbidden subgraphs, stability and hamiltonicity ⋮ Forbidden subgraphs, hamiltonicity and closure in claw-free graphs ⋮ Vertex pancyclism in claw-free graphs ⋮ Neighborhood conditions for graphs with induced claws ⋮ Minimum degree, leaf number and traceability

Cites Work

• Sufficient conditions for a graph to be Hamiltonian
• Connected, locally 2-connected,K1,3-free graphs are panconnected
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Forbidden subgraphs and Hamiltonian properties and graphs