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 the normal view instead:
scientific article; zbMATH DE number 2237533
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the lower bound for the chromatic number of graphs with given maximal degree and girth |
scientific article; zbMATH DE number 2237533 |
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
