Finding disjoint trees in planar graphs in linear time

1993

Presented at the AMS IMS SIAM Joint Summer Research Conference on Graph Minors, Seattle, WA, USA

Additional Metadata
MSC	Planar graphs; geometric and topological aspects of graph theory (msc 05C10), Trees (msc 05C05), Graph algorithms (msc 05C85)
Publisher	A.M.S.
Editor	N. Robertson (Neil) , P.D. Seymour (Paul)
Series	Contemporary mathematics
Conference	AMS IMS SIAM Joint Summer Research Conference on Graph Minors
Organisation	Networks and Optimization
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	Reed, B., Robertson, N., Seymour, P., & Schrijver, L. (1993). Finding disjoint trees in planar graphs in linear time. In N. Robertson & P. Seymour (Eds.), Graph structure theory (pp. 295–301). A.M.S.

Publication