Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686)
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: Sum coloring and interval graphs: A tight upper bound for the minimum number of colors |
scientific article; zbMATH DE number 2083651
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sum coloring and interval graphs: A tight upper bound for the minimum number of colors |
scientific article; zbMATH DE number 2083651 |
Statements
Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (English)
0 references
6 August 2004
0 references
Coloring
0 references
Interval graphs
0 references
Upper bound
0 references
0 references
0.9512103
0 references
0 references
0.91931236
0 references
0.91879594
0 references
0.91170496
0 references
0.9115057
0 references
0 references
0.91008484
0 references
0.9099373
0 references
0.9063395
0 references
