Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs

DOI10.1016/j.jctb.2018.06.006zbMath1402.05130OpenAlexW2883400171MaRDI QIDQ1633754

Shipeng Wang, Petr Vrána, Zdeněk Ryjáček

Publication date: 20 December 2018

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2018.06.006

zbMATH Keywords

claw-free graphHamiltonian graphline graphclosuredegree conditionThomassen's conjecture\(\{K_{14}4} + e \}\)-free graphK_{1

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items

Hamilton cycles in line graphs of 3-hypergraphs, Thomassen's conjecture for line graphs of 3-hypergraphs, The formula for Turán number of spanning linear forests, Unnamed Item, Perfect matchings and \(K_{1,p}\)-restricted graphs, Spanning trails in a 2-connected graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
• On 1-Hamilton-connected claw-free graphs
• Hamilton cycles in 5-connected line graphs
• How many conjectures can you stand? A survey
• On hamiltonian line graphs and connectivity
• Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
• Hamiltonian properties of graphs with large neighborhood unions
• A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
• On a closure concept in claw-free graphs
• Hamiltonian results inK1,3-free graphs
• A Relationship Between Thomassen's Conjecture and Bondy's Conjecture
• Longest paths and cycles in K1,3-free graphs
• Hamilton cycles in claw-free graphs
• Reflections on graph theory
• A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• Clique covering and degree conditions for Hamiltonicity in claw-free graphs