"Graph Minors 1: A Short Proof of the Path-width Theorem."

Reinhard Diestel (1995)

> Home

Details and statistics

DOI: 10.1017/S0963548300001450

access: closed

type: Journal Article

metadata version: 2020-03-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cpc/Diestel95
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/Diestel95
Reinhard Diestel:
Graph Minors 1: A Short Proof of the Path-width Theorem. Comb. Probab. Comput. 4: 27-30 (1995)

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.