\((k,j)\)-coloring of sparse graphs (Q411834)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | \((k,j)\)-coloring of sparse graphs |
scientific article |
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