Degree conditions on induced claws

DOI10.1016/j.disc.2007.10.026zbMath1175.05069OpenAlexW1980978007MaRDI QIDQ998442

Roman Čada

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.10.026

zbMATH Keywords

clawclosurehamiltonicitydegree conditionsclaw free graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Heavy subgraphs, stability and Hamiltonicity ⋮ Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions ⋮ Hamiltonian claw-free graphs and \(o\)-heavy graphs involving induced cycles ⋮ Hamilton cycles in almost distance-hereditary graphs ⋮ Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs ⋮ Conditions for graphs to be path partition optimal ⋮ On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs ⋮ Heavy subgraph pairs for traceability of block-chains ⋮ Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs ⋮ The \(*\)-closure for graphs and claw-free graphs ⋮ Characterizing heavy subgraph pairs for pancyclicity ⋮ Forbidden subgraphs for longest cycles to contain vertices with large degrees

Cites Work

• Unnamed Item
• On hamiltonian line graphs and connectivity
• A method in graph theory
• 9-connected claw-free graphs are Hamilton-connected
• A note on \(K_ 4\)-closures in hamiltonian graph theory
• A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
• Dirac's minimum degree condition restricted to claws
• On a closure concept in claw-free graphs
• Closure concepts for claw-free graphs
• Closure and stable Hamiltonian properties in claw-free graphs
• Reflections on graph theory
• Clique covering and degree conditions for Hamiltonicity in claw-free graphs