A generalization of Hamiltonian cycles for trees

DOI10.21136/CMJ.1976.101430MaRDI QIDQ4141277zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3340111 (Why is no real title available?)
• scientific article; zbMATH DE number 3377257 (Why is no real title available?)
• scientific article; zbMATH DE number 3192675 (Why is no real title available?)
• On a certain ordering of the vertices of a tree
• The square of every two-connected graph is Hamiltonian

Cited in

(1)

• The upper traceable number of a graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4141277)