Forbidden triples implying Hamiltonicity: for all graphs

DOI10.7151/DMGT.1212zbMATH Open1060.05063OpenAlexW2066681535MaRDI QIDQ4823293FDOQ4823293

Authors: Ralph Faudree, Ronald Gould, Michael Jacobson 

Publication date: 27 October 2004

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

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

Recommendations

• Forbidden triples for Hamiltonicity
• Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
• Characterizing forbidden clawless triples implying Hamiltonian graphs
• Two forbidden subgraph pairs for Hamiltonicity of 3-connected graphs
• Four forbidden subgraph pairs for Hamiltonicity of 3-connected graphs

zbMATH Keywords

induced subgraphforbidden subgraphsHamiltonian graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Cited In (13)

• Recent advances on the Hamiltonian problem: survey III
• Characterizing forbidden clawless triples implying Hamiltonian graphs
• Forbidden triples for Hamiltonicity
• Pairs of forbidden subgraphs and 2-connected supereulerian graphs
• Forbidden set of induced subgraphs for 2-connected supereulerian graphs
• Forbidden subgraphs and the existence of a 2-factor
• Forbidden pairs for \(k\)-connected Hamiltonian graphs
• Graph classes characterized both by forbidden subgraphs and degree sequences
• Hamiltonian circuits in N₂‐locally connected K_1,3‐free graphs
• Minimal forbidden sets for degree sequence characterizations
• Forbidden subgraphs generating a finite set
• Potential forbidden triples implying hamiltonicity: for sufficiently large graphs
• Non-minimal degree-sequence-forcing triples

This page was built for publication: Forbidden triples implying Hamiltonicity: for all graphs

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