On maximally distant spanning trees of a graph

DOI10.1007/BF02276756zbMath0335.05102OpenAlexW387669780MaRDI QIDQ1229218

K. Appert

Publication date: 1976

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02276756

Mathematics Subject Classification ID

Trees (05C05) Algorithms in computer science (68W99)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• A Solution of the Shannon Switching Game
• Minimum partition of a matroid into independent subsets
• Depth-First Search and Linear Graph Algorithms
• Decomposition of Finite Graphs Into Forests