A short proof of Nash-Williams' theorem for the arboricity of a graph
From MaRDI portal
Publication:1323488
DOI10.1007/BF01202467zbMATH Open0798.05042MaRDI QIDQ1323488FDOQ1323488
Authors: Boliong Chen, Makoto Matsumoto, Jianfang Wang, Zhongfu Zhang, Jianxun Zhang 
Publication date: 10 May 1994
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 221058
- An enhancement of Nash-Williams' theorem on edge arboricity of graphs
- A short proof of Brooks’ Theorem for vertex arboricity
- Nash-Williams' theorem on decomposing graphs into forests
- scientific article; zbMATH DE number 3873386
- A note on the arboricity of graphs
- Short proofs of theorems of Nash-Williams and Tutte
- A short proof of a theorem on degree sets of graphs
- A graph-theoretic proof of arrow's dictator theorem
- The Nash-Williams conjecture and the dominating cycle conjecture
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
Cited In (13)
- A self-stabilizing algorithm for cut problems in synchronous networks
- Simple planar graph partition into three forests
- Arboricity and tree-packing in locally finite graphs
- A short proof of the random Ramsey theorem
- Extensions of matroid covering and packing
- Title not available (Why is that?)
- A short proof of Brooks’ Theorem for vertex arboricity
- Fast approximation for computing the fractional arboricity and extraction of communities of a graph
- Nash-Williams' theorem on decomposing graphs into forests
- Self-stabilizing Cuts in Synchronous Networks
- An enhancement of Nash-Williams' theorem on edge arboricity of graphs
- Short proofs of theorems of Nash-Williams and Tutte
- A note on the arboricity of graphs
This page was built for publication: A short proof of Nash-Williams' theorem for the arboricity of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323488)
