university website Publications by Year
  • sign in
  • Probability, Networks and Algorithms /
  • Journal of Combinatorial Theory - Series B /
  • Article
  • Search

J. Geelen (Jim), A.M.H. Gerards (Bert) and G. Whittle (Geoff)

2002

Branch-width and well-quasi-ordering in matroids and graphs

Publication

Publication

Journal of Combinatorial Theory - Series B , Volume 84 p. 270- 290

Additional Metadata
THEME Logistics (theme 3)
Publisher Academic Press
Journal Journal of Combinatorial Theory - Series B
Organisation Probability, Networks and Algorithms
Citation
APA Style
  • AAA Style
  • APA Style
  • Cell Style
  • Chicago Style
  • Harvard Style
  • IEEE Style
  • MLA Style
  • Nature Style
  • Vancouver Style
  • American-Institute-of-Physics Style
  • Council-of-Science-Editors Style
  • BibTex Format
  • Endnote Format
  • RIS Format
  • CSL Format
  • DOIs only Format
Geelen, J, Gerards, A.M.H, & Whittle, G. (2002). Branch-width and well-quasi-ordering in matroids and graphs. Journal of Combinatorial Theory - Series B, 84, 270–290.
Full Text ( Final Version , 3mb ) cover

university website
  • Address

    • Centrum Wiskunde & Informatica
    • Science Park 123 | 1098 XG Amsterdam | the Netherlands
  • Publishing at CWI

    • Open Science Portal
    • Submit Your CWI Work
  • Questions or comments?

    • repository@cwi.nl
artudis website

Workflow

Workflow

Add Content


User Publication Person Organisation Collection
Close