Spanning trees with pairwise nonadjacent endvertices

DOI10.1016/S0012-365X(96)00306-8zbMath0876.05020MaRDI QIDQ1363666

O. Diekmann

Publication date: 10 August 1997

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

zbMATH Keywords

spanning treeconnected graphindependency treeendverticesdepth-first-search tree

Mathematics Subject Classification ID

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

Related Items (6)

On spanning trees with restricted degrees ⋮ Brooks' Theorem and Beyond ⋮ A spanning tree with high degree vertices ⋮ Spanning trees: A survey ⋮ Complexity of independency and cliquy trees ⋮ On 1-sum flows in undirected graphs

Cites Work

• The forest plus stars colouring problem
• Graphs in which every path is contained in a Hamilton path.
• Randomly Traceable Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

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