Induced \(S(K_{1,3})\) and hamiltonian cycles in the square of a graph

DOI10.1016/S0012-365X(99)00115-6zbMath0939.05055WikidataQ127720620 ScholiaQ127720620MaRDI QIDQ1817578

Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Zdeněk Ryjáček

Publication date: 29 June 2000

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

zbMATH Keywords

square of a graphhamiltonian cycle

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

Connected even factors in the square of essentially 2-edge-connected graph ⋮ A short proof of the versatile version of Fleischner's theorem ⋮ Cycles in squares of trees without generalized claws ⋮ Star subdivisions and connected even factors in the square of a graph ⋮ Single-source three-disjoint path covers in cubes of connected graphs ⋮ Disjoint path covers in cubes of connected graphs ⋮ Trestles in the squares of graphs

This page was built for publication: Induced \(S(K_{1,3})\) and hamiltonian cycles in the square of a graph