A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs

DOI10.1016/j.disc.2012.03.042zbMath1246.05088OpenAlexW1967438624MaRDI QIDQ442331

Alexandru I. Tomescu

Publication date: 10 August 2012

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

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

zbMATH Keywords

claw-free graphperfect matchinggraph squarevertex-pancyclicity

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Set graphs. IV. Further connections with claw-freeness

Cites Work

• Unnamed Item
• In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
• Quasi-claw-free graphs
• Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
• Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
• Hamiltonian results inK1,3-free graphs
• The square of a connected S(K1,3)-free graph is vertex pancyclic
• Graphs with 1-Factors
• Almost claw‐free graphs

This page was built for publication: A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs