\((k,j)\)-coloring of sparse graphs (Q411834)
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: \((k,j)\)-coloring of sparse graphs |
scientific article; zbMATH DE number 6029130
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \((k,j)\)-coloring of sparse graphs |
scientific article; zbMATH DE number 6029130 |
Statements
\((k,j)\)-coloring of sparse graphs (English)
0 references
30 April 2012
0 references
vertex partition
0 references
subgraphs with bounded maximum degree
0 references
maximum average degree
0 references
discharging procedure
0 references
linear programming
0 references
0 references
0 references
