Cycles in squares of trees without generalized claws

DOI10.1016/j.disc.2012.06.022zbMath1277.05041OpenAlexW2109141061MaRDI QIDQ383769

Stephan Brandt, Janina Müttel, Dieter Rautenbach

Publication date: 6 December 2013

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

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

zbMATH Keywords

circumferencecaterpillarsquare of a treesubdivided claw

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• The circumference of the square of a connected graph
• In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
• Induced \(S(K_{1,3})\) and hamiltonian cycles in the square of a graph
• The square of every two-connected graph is Hamiltonian
• Hamiltonian results inK1,3-free graphs
• The square of a connected S(K1,3)-free graph is vertex pancyclic
• Trees with Hamiltonian square

This page was built for publication: Cycles in squares of trees without generalized claws