Spanning trees with pairwise nonadjacent endvertices

DOI10.1016/S0012-365X(96)00306-8MaRDI QIDQ1363666zbMATH OpenFDO

Authors O. Diekmann

Publication date 10 August 1997

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

connected graphspanning treeindependency treeendverticesdepth-first-search tree

Mathematics Subject Classification ID

Trees (05C05) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Graphs with all spanning trees nonisomorphic
• Independent trees in graphs
• Spanning trees with large number of end vertices
• scientific article; zbMATH DE number 1953097

Cites work

• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• Graphs in which every path is contained in a Hamilton path.
• Randomly Traceable Graphs
• The forest plus stars colouring problem

Cited in

(10)

• Complexity of independency and cliquy trees
• Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves
• Ends in spanning trees
• A spanning tree with high degree vertices
• scientific article; zbMATH DE number 3855138 (Why is no real title available?)
• Brooks' Theorem and Beyond
• scientific article; zbMATH DE number 4132180 (Why is no real title available?)
• On spanning trees with restricted degrees
• Spanning trees: A survey
• On 1-sum flows in undirected graphs

This page was built for publication: Spanning trees with pairwise nonadjacent endvertices

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