The square of a connected S(K1,3)-free graph is vertex pancyclic
From MaRDI portal
Publication:3815333
DOI10.1002/jgt.3190090415zbMath0664.05038OpenAlexW2112272543MaRDI QIDQ3815333
George R. T. Hendry, Walter Vogler
Publication date: 1985
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190090415
Related Items
Claw-free graphs---a survey ⋮ Connected even factors in the square of essentially 2-edge-connected graph ⋮ Cycles in squares of trees without generalized claws ⋮ A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs ⋮ Star subdivisions and connected even factors in the square of a graph ⋮ Trestles in the squares of graphs ⋮ Number of vertices of degree three in spanning 3-trees in square graphs ⋮ Extending cycles in graphs ⋮ Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
This page was built for publication: The square of a connected S(K1,3)-free graph is vertex pancyclic
