Abstract
We establish a minimax formula for the chromatic index of series-parallel graphs; and also prove the correctness of a "greedy" algorithm for finding a vertex-colouring of a series-parallel graph.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 379-392 |
| Number of pages | 14 |
| Journal | Combinatorica |
| Volume | 10 |
| Issue number | 4 |
| DOIs | |
| State | Published - Dec 1990 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Discrete Mathematics and Combinatorics
- Computational Mathematics
Keywords
- AMS subject classification (1980): 05C15
Fingerprint
Dive into the research topics of 'Colouring series-parallel graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver