Edge-Disjoint Spanning Trees of Finite Graphs

1961/01/01 by C. St. J. A. Nash‐Williams, C. St.J. A. Nash-Williams · 9 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Artificial intelligence #Citation #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Disjoint sets #Enhanced Data Rates for GSM Evolution #Graph theory and applications #Mathematics #Spanning tree #World Wide Web

paper · doi:10.1112/jlms/s1-36.1.445

crossref issued 1961/01/01 · crossref published 1961/01/01 · crossref published-print 1961/01/01 · openalex publication_date 1961/01/01 · crossref created 2007/02/14 · crossref published-online 2016/12/23 · crossref deposited 2021/07/21 · openalex created_date 2025/10/10 · crossref indexed 2026/07/28 · openalex updated_date 2026/07/29

Cited by

• Enumerating tuples of spanning trees
• Adjacency labelling for proper minor-closed graph classes
• Completely Independent Steiner Trees
• Pebble game algorithms and sparse graphs
• Arboricity and bipartite subgraph listing algorithms
• Efficient computation of implicit representations of sparse graphs
• Minimum partition of a matroid into independent subsets
• A short proof of Nash-Williams' theorem for the arboricity of a graph
• Arboricity [wikipedia]