Colouring series-parallel graphs

Research output: Contribution to journalArticle

27 Scopus citations

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 languageEnglish (US)
Pages (from-to)379-392
Number of pages14
JournalCombinatorica
Volume10
Issue number4
DOIs
StatePublished - Dec 1 1990
Externally publishedYes

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