The circumference of the square of a connected graph

DOI10.1007/s00493-014-2899-4zbMath1349.05187OpenAlexW1972536527MaRDI QIDQ484548

Janina Müttel, Dieter Rautenbach, Stephan Brandt

Publication date: 7 January 2015

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-014-2899-4

zbMATH Keywords

connected graphlongest cycle

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Distance in graphs (05C12) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Cycles in squares of trees without generalized claws

Cites Work

• In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
• Algorithmic graph theory and perfect graphs
• The square of every two-connected graph is Hamiltonian
• Trees with Hamiltonian square
• Unnamed Item

This page was built for publication: The circumference of the square of a connected graph