On the Problem of Decomposing a Graph into n Connected Factors

1961/01/01 by W. T. Tutte · 9 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Art #Citation #Combinatorics #Computer science #Graph #Graph theory and applications #Humanities #Information retrieval #Library science #Mathematics #graph theory and CDMA systems

paper · doi:10.1112/jlms/s1-36.1.221

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 · openalex created_date 2016/06/24 · crossref published-online 2016/12/23 · crossref deposited 2021/07/21 · crossref indexed 2026/06/21 · openalex updated_date 2026/06/22

Cited by

• Enumerating tuples of spanning trees
• Completely Independent Steiner Trees
• Graph factors and factorization: 1985–2003: A survey
• Pebble game algorithms and sparse graphs
• Minimum partition of a matroid into independent subsets
• Anti-Ramsey number of disjoint rainbow bases in all matroids
• The Planar Tree Packing Theorem
• NASH‐WILLIAMS’ THEOREM ON DECOMPOSING GRAPHS INTO FORESTS
• Arboricity [wikipedia]