Closure for \K₁,4,K₁,4 + e\-free graphs

DOI10.1016/J.JCTB.2018.06.006zbMATH Open1402.05130OpenAlexW2883400171MaRDI QIDQ1633754FDOQ1633754

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

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

Recommendations

• scientific article; zbMATH DE number 2147925
• Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
• A note on \(K_ 4\)-closures in hamiltonian graph theory
• scientific article; zbMATH DE number 2186978
• The \(*\)-closure for graphs and claw-free graphs
• Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
• Cyclability in \(k\)-connected \(K_{1,4}\)-free graphs
• \(K_{4}\)-free graphs with no odd holes
• Clique roots of \(K_4\)-free chordal graphs
• On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs

zbMATH Keywords

line graphclaw-free graphclosureHamiltonian graphdegree conditionThomassen's conjecture\(\{K_{14}4} + e \}\)-free graphK_{1

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Graph theory
• On a closure concept in claw-free graphs
• Longest paths and cycles in K1,3-free graphs
• On Eulerian and Hamiltonian Graphs and Line Graphs
• A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
• Hamiltonian results inK1,3-free graphs
• Hamilton cycles in 5-connected line graphs
• Reflections on graph theory
• On hamiltonian line graphs and connectivity
• Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
• Clique covering and degree conditions for Hamiltonicity in claw-free graphs
• Title not available (Why is that?)
• On 1-Hamilton-connected claw-free graphs
• A closure for 1-Hamilton-connectedness in claw-free graphs
• How many conjectures can you stand? A survey
• Title not available (Why is that?)
• Title not available (Why is that?)
• Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
• Hamilton cycles in claw-free graphs
• Hamiltonian properties of graphs with large neighborhood unions
• A relationship between Thomassen's conjecture and Bondy's conjecture

Cited In (11)

• Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
• Title not available (Why is that?)
• Perfect matchings in graphs with prescribed local restrictions
• Closure concepts for claw-free graphs
• The formula for Turán number of spanning linear forests
• A note on \(K_ 4\)-closures in hamiltonian graph theory
• Thomassen's conjecture for line graphs of 3-hypergraphs
• The Ryjáček closure and a forbidden subgraph
• Perfect matchings and \(K_{1,p}\)-restricted graphs
• Hamilton cycles in line graphs of 3-hypergraphs
• Spanning trails in a 2-connected graph

This page was built for publication: Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs

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