Coloring planar perfect graphs by decomposition (Q1093649): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Strong Perfect Graph Conjecture for Planar Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An O(N2) algorithm for coloring perfect planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5661516 / rank | |||
Normal rank | |||
Revision as of 12:00, 18 June 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
