On cycle lengths in claw-free graphs with complete closure

DOI10.1016/j.disc.2009.03.053zbMath1208.05062OpenAlexW2090981096MaRDI QIDQ960969

Zdeněk Ryjáček, Zdzisław Skupień, Petr Vrána

Publication date: 29 March 2010

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

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

zbMATH Keywords

claw-free graphcycle lengthclosurepancyclicity

Mathematics Subject Classification ID

Paths and cycles (05C38) Infinite graphs (05C63)

Related Items (1)

Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of matchings in random regular graphs and bipartite graphs
• The asymptotic distribution of short cycles in random regular graphs
• The asymptotic connectivity of labelled regular graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Cubic Ramanujan graphs
• Constructions for cubic graphs with large girth
• Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
• On a closure concept in claw-free graphs
• Almost all cubic graphs are Hamiltonian
• A canonical representation of trivalent hamiltonian graphs
• Almost all regular graphs are hamiltonian
• Closure and stable Hamiltonian properties in claw-free graphs
• Claw-free graphs with complete closure

This page was built for publication: On cycle lengths in claw-free graphs with complete closure