Coloring planar perfect graphs by decomposition (Q1093649): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q234397 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Colin J. H. McDiarmid / rank | |||
Normal rank | |||
Revision as of 08:33, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Coloring planar perfect graphs by decomposition |
scientific article |
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
