Spanning trees with pairwise nonadjacent endvertices

DOI10.1016/S0012-365X(96)00306-8zbMATH Open0876.05020MaRDI QIDQ1363666FDOQ1363666

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graphs in which every path is contained in a Hamilton path.
• Randomly Traceable Graphs
• The forest plus stars colouring problem

Cited In (9)

• Spanning trees: A survey
• On spanning trees with restricted degrees
• A spanning tree with high degree vertices
• On 1-sum flows in undirected graphs
• Title not available (Why is that?)
• Ends in spanning trees
• Complexity of independency and cliquy trees
• Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves
• Brooks' Theorem and Beyond

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)