"Excluding any graph as a minor allows a low tree-width 2-coloring."

Matt DeVos et al. (2004)

> Home

Details and statistics

DOI: 10.1016/J.JCTB.2003.09.001

access: closed

type: Journal Article

metadata version: 2024-07-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jct/DeVosDOSRSV04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/DeVosDOSRSV04
Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan:
Excluding any graph as a minor allows a low tree-width 2-coloring. J. Comb. Theory B 91(1): 25-41 (2004)

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.