Almost claw‐free graphs
From MaRDI portal
Publication:4304252
DOI10.1002/jgt.3190180505zbMath0808.05067OpenAlexW1987325509MaRDI QIDQ4304252
Publication date: 8 September 1994
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190180505
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items (24)
Claw-free graphs---a survey ⋮ Matching extension in \(K_{1,r}\)-free graphs with independent claw centers ⋮ Unnamed Item ⋮ Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter ⋮ Quasi-claw-free graphs ⋮ Unnamed Item ⋮ On 3-connected Hamiltonian line graphs ⋮ A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs ⋮ Hamiltonian properties of locally connected graphs with bounded vertex degree ⋮ Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs ⋮ Spanning 3-ended trees in almost claw-free graphs ⋮ Hamiltonicity of claw-free graphs and Fan-type conditions ⋮ Neighborhood union conditions for Hamiltonicity of \(P_{3}\)-dominated graphs ⋮ Perfect matchings and \(K_{1,p}\)-restricted graphs ⋮ Path factors and parallel knock-out schemes of almost claw-free graphs ⋮ Hamiltonicity in Partly claw-free graphs ⋮ On hamiltonicity of \(P_{3}\)-dominated graphs ⋮ Fully cycle extendability of \(K_{1,4}\)-restricted graphs ⋮ Hamiltonicity and pancyclicity of Cartesian products of graphs ⋮ On the independence number in \(K_{1,r+1}\)-free graphs ⋮ Global insertion and Hamiltonicity in DCT-graphs ⋮ Hamiltonian Chordal Graphs are not Cycle Extendable ⋮ Hamiltonicity and pancyclicity of generalized prisms ⋮ Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
This page was built for publication: Almost claw‐free graphs
