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

2002

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, B., & Whittle, G. (2002). Branch-width and well-quasi-ordering in matroids and graphs. Journal of Combinatorial Theory - Series B, 84, 270–290.

Publication