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

DOI10.1016/J.DISC.2012.03.042MaRDI QIDQ442331zbMATH OpenOpenAlexFDO

Authors 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 graphgraph squareperfect matchingvertex-pancyclicity

Mathematics Subject Classification ID

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

Recommendations

• Vertex pancyclism in claw-free graphs
• Vertex pancyclicity in quasi claw-free graphs
• The square of a connected S(K1,3)-free graph is vertex pancyclic
• Vertex pancyclicity of quadrangularly connected claw-free graphs
• scientific article; zbMATH DE number 147642

Cites work

• Almost claw‐free graphs
• Graphs with 1-Factors
• Hamiltonian results inK1,3-free graphs
• scientific article; zbMATH DE number 3492724 (Why is no real title available?)
• 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
• The square of a connected S(K1,3)-free graph is vertex pancyclic

Cited in

(2)

• The square of a connected S(K1,3)-free graph is vertex pancyclic
• Set graphs. IV. Further connections with claw-freeness

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q442331)