On the lower bound for the chromatic number of graphs with given maximal degree and girth (Q2575545)
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: On the lower bound for the chromatic number of graphs with given maximal degree and girth |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the lower bound for the chromatic number of graphs with given maximal degree and girth |
scientific article |
Statements
On the lower bound for the chromatic number of graphs with given maximal degree and girth (English)
0 references
12 December 2005
0 references
coloring
0 references
sparse graph
0 references
density
0 references
