Coloring planar perfect graphs by decomposition (Q1093649)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Coloring planar perfect graphs by decomposition |
scientific article; zbMATH DE number 4023315
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coloring planar perfect graphs by decomposition |
scientific article; zbMATH DE number 4023315 |
Statements
Coloring planar perfect graphs by decomposition (English)
0 references
1986
0 references
This paper describes a decomposition scheme for colouring perfect graphs, so that it suffices to colour perfect graphs which are well connected. This approach yields a new good colouring algorithm for perfect planar graphs, and it seems that the approach goes further.
0 references
decomposition scheme
0 references
colouring perfect graphs
0 references
colouring algorithm
0 references
perfect planar graphs
0 references
0 references
0 references
0.92841977
0 references
0.92354095
0 references
0.91486925
0 references
0 references
