Closure for \K₁,4,K₁,4 + e\-free graphs
From MaRDI portal
Publication:1633754
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
Cites work
- scientific article; zbMATH DE number 4164900 (Why is no real title available?)
- scientific article; zbMATH DE number 4108816 (Why is no real title available?)
- scientific article; zbMATH DE number 867709 (Why is no real title available?)
- A closure for 1-Hamilton-connectedness in claw-free graphs
- A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
- A relationship between Thomassen's conjecture and Bondy's conjecture
- Clique covering and degree conditions for Hamiltonicity in claw-free graphs
- Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks
- Graph theory
- Hamilton cycles in 5-connected line graphs
- Hamilton cycles in claw-free graphs
- Hamiltonian properties of graphs with large neighborhood unions
- Hamiltonian results inK1,3-free graphs
- How many conjectures can you stand? A survey
- Longest paths and cycles in K1,3-free graphs
- Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
- On 1-Hamilton-connected claw-free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- On a closure concept in claw-free graphs
- On hamiltonian line graphs and connectivity
- Reflections on graph theory
Cited in
(11)- A note on \(K_ 4\)-closures in hamiltonian graph theory
- The Ryjáček closure and a forbidden subgraph
- Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
- Spanning trails in a 2-connected graph
- Perfect matchings in graphs with prescribed local restrictions
- Thomassen's conjecture for line graphs of 3-hypergraphs
- scientific article; zbMATH DE number 2147925 (Why is no real title available?)
- Hamilton cycles in line graphs of 3-hypergraphs
- Perfect matchings and \(K_{1,p}\)-restricted graphs
- Closure concepts for claw-free graphs
- The formula for Turán number of spanning linear forests
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)
