"Finding disjoint trees in planar graphs in linear time."

Bruce A. Reed et al. (1991)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2021-08-27

- no documents available
- export record
  dblp key:
  - conf/gst/ReedRSS91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gst/ReedRSS91
Bruce A. Reed, Neil Robertson, Alexander Schrijver, Paul D. Seymour:
Finding disjoint trees in planar graphs in linear time. Graph Structure Theory 1991: 295-301

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.