A generalization of Hamiltonian cycles for trees

DOI10.21136/cmj.1976.101430zbMath0365.05030OpenAlexW3047971397MaRDI QIDQ4141277

Ladislav Nebeský

Publication date: 1976

Full work available at URL: https://eudml.org/doc/12968

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (1)

The upper traceable number of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The square of every two-connected graph is Hamiltonian
• On a certain ordering of the vertices of a tree

This page was built for publication: A generalization of Hamiltonian cycles for trees