On the coloration of perfect graphs (Q4407446)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1944138
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the coloration of perfect graphs |
scientific article; zbMATH DE number 1944138 |
Statements
5 November 2003
0 references
perfect graph
0 references
chromatic number
0 references
perfectly orderable graph
0 references
sequential coloring
0 references
weakly triangulated graph
0 references
Meyniel graph
0 references
survey
0 references
On the coloration of perfect graphs (English)
0 references
The chapters of this survey paper are the following: Introduction; Basic definitions and notation; Bounds on the chromatic number; Edge coloring; Sequential algorithms; Sequential coloring with bichromatic exchange; Sequential coloring with trichromatic exchange; Coloring by contraction (perfectly orderable graphs, weakly triangulated graphs, Meyniel graphs); Other methods. The list of references includes 93 titles. For the entire collection see [Zbl 1005.00014].
0 references