On a closure concept in claw-free graphs
From MaRDI portal
Publication:1362093
DOI10.1006/jctb.1996.1732zbMath0872.05032MaRDI QIDQ1362093
Publication date: 12 August 1997
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1996.1732
05C45: Eulerian and Hamiltonian graphs
Related Items
Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs, Quadrangularly connected claw-free graphs, The path partition conjecture is true for claw-free graphs, On cycle lengths in claw-free graphs with complete closure, Contractible subgraphs, Thomassen's conjecture and the dominating cycle conjecture for snarks, Path-comprehensive and vertex-pancyclic properties of super line graph \(\mathcal L_2(G)\), The \(*\)-closure for graphs and claw-free graphs, Degree conditions on induced claws, A note on the dominating circuit conjecture and subgraphs of essentially 4-edge-connected cubic graphs, Circumferences and minimum degrees in 3-connected claw-free graphs, Closure, stability and iterated line graphs with a 2-factor, Forbidden subgraphs, stability and hamiltonicity, Closure and Hamiltonian-connectivity of claw-free graphs, Forbidden subgraphs, hamiltonicity and closure in claw-free graphs, 9-connected claw-free graphs are Hamilton-connected, Closure and forbidden pairs for Hamiltonicity, Cycles through given vertices and closures, Line graphs and forbidden induced subgraphs, Hamiltonicity and minimum degree in 3-connected claw-free graphs, All 4-connected line graphs of claw free graphs are Hamiltonian connected, Hamiltonian connected hourglass free line graphs, Circumferences of regular claw-free graphs, On Hamiltonicity of \{claw, net\}-free graphs, Even subgraphs of bridgeless graphs and 2-factors of line graphs, On the number of components in 2-factors of claw-free graphs, Forbidden subgraphs that imply 2-factors, Toughness in graphs -- a survey, Hamiltonicity in 3-connected claw-free graphs, Every 3-connected, essentially 11-connected line graph is Hamiltonian, Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected, Unnamed Item, On factors of 4-connected claw-free graphs, Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs, The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs, Contractible Subgraphs, Thomassen's Conjecture and the Dominating Cycle Conjecture for Snarks, On components of 2-factors in claw-free graphs, Computing Sharp 2-Factors in Claw-Free Graphs, Hamiltonicity in Partly claw-free graphs, Minimal claw-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- On hamiltonian line graphs and connectivity
- Tough graphs and Hamiltonian circuits.
- Hamiltonian results inK1,3-free graphs
- Toughness and the existence ofk-factors
- Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
- Reflections on graph theory
- Hamiltonian circuits in N2‐locally connected K1,3‐free graphs
