Decomposition of sparse graphs, with application to game coloring number (Q968426)
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: Decomposition of sparse graphs, with application to game coloring number |
scientific article; zbMATH DE number 5703952
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decomposition of sparse graphs, with application to game coloring number |
scientific article; zbMATH DE number 5703952 |
Statements
Decomposition of sparse graphs, with application to game coloring number (English)
0 references
5 May 2010
0 references
edge-partition
0 references
forest
0 references
subgraphs with bounded maximum degree
0 references
game coloring number
0 references
0.8316310048103333
0 references
0.8009758591651917
0 references
0.7839832901954651
0 references
0.7740758061408997
0 references
0.770401656627655
0 references
