Abstract
We show that, for any graph or matroid, its "arboricity" and its "list arboricity" are equal.
Original language | English (US) |
---|---|
Pages (from-to) | 150-151 |
Number of pages | 2 |
Journal | Journal of Combinatorial Theory. Series B |
Volume | 72 |
Issue number | 1 |
DOIs | |
State | Published - 1998 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics