Sufficient conditions for a graph to be Hamiltonian

DOI10.1016/0095-8956(74)90061-6zbMath0275.05126OpenAlexW2006711703MaRDI QIDQ2265440

Stephen T. Hedetniemi, S. Goodman

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(74)90061-6

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs, Dirac's minimum degree condition restricted to claws, Claw-free graphs---a survey, Connectivity, traceability and Hamiltonicity, Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs, Forbidden subgraphs for chorded pancyclicity, Every 3-connected \(\{K_{1,3},N_{3,3,3}\}\)-free graph is Hamiltonian, Interval function, induced path function, (claw, paw)-free graphs and axiomatic characterizations, Leaf number and Hamiltonian \(C_4\)-free graphs, 2-Trees: Structural insights and the study of Hamiltonian paths, A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence, Contraction theorems in Hamiltonian graph theory, Closure and forbidden pairs for Hamiltonicity, Disconnected forbidden subgraphs, toughness and Hamilton cycles, On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs, Graphs with forbidden subgraphs and leaf number, Forbidden subgraphs and Hamiltonian properties and graphs, Existence of dominating cycles and paths, Spanning paths in graphs, Hamiltonicity in claw-free graphs, On minimum degree, leaf number, traceability and Hamiltonicity in graphs, Degree conditions on claws and modified claws for Hamiltonicity of graphs, Closure and forbidden pairs for 2-factors, Unnamed Item, Graph theory (algorithmic, algebraic, and metric problems), Generalizations of line graphs and applications, A clique-covering sufficient condition for hamiltonicity of graphs, Axiomatic Characterization of Claw and Paw-Free Graphs Using Graph Transit Functions, Fan's condition on induced subgraphs for circumference and pancyclicity, Normal Eulerian clique-covering and hamiltonicity, Unnamed Item, Forbidden subgraphs, stability and hamiltonicity, On a Goodman – Hedetniemi Sufficient Condition for the Graph Hamiltonicity, Forbidden subgraphs, hamiltonicity and closure in claw-free graphs, Neighborhood conditions for graphs with induced claws, Minimum degree, leaf number and traceability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Hamilton's ideals
• Note on Hamilton Circuits
• On Hamiltonian Line-Graphs
• Sufficient Conditions for Circuits in Graphs^†
• Some Theorems on Abstract Graphs