On maximally distant spanning trees of a graph
type: Item
instance of: scholarly article
title: On maximally distant spanning trees of a graph
zbMATH Open document ID: 0335.05102
DOI: 10.1007/BF02276756
author: K. Appert
published in: Computing
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 3523581
MaRDI profile type: Publication
cites work: Q5668821
cites work: Minimum partition of a matroid into independent subsets
cites work: A Solution of the Shannon Switching Game
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: Decomposition of Finite Graphs Into Forests
cites work: Depth-First Search and Linear Graph Algorithms
cites work: On the Problem of Decomposing a Graph into n Connected Factors
full work available at URL: https://doi.org/10.1007/bf02276756
OpenAlex ID: W387669780
description: scientific article; zbMATH DE number 3523581