A note on list arboricity

Research output: Contribution to journalArticle

8 Scopus citations

Abstract

We show that, for any graph or matroid, its "arboricity" and its "list arboricity" are equal.

Original languageEnglish (US)
Pages (from-to)150-151
Number of pages2
JournalJournal of Combinatorial Theory. Series B
Volume72
Issue number1
DOIs
StatePublished - Jan 1 1998
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'A note on list arboricity'. Together they form a unique fingerprint.

  • Cite this