The bibliographic entry was discovered and compiled by a machine, and published without a person checking it against the publication. The publication itself is the authors' own work — this badge says nothing about it.
On an upper bound of a graph's chromatic number, depending on the graph's degree and density
The work
| Authors | O.V Borodin; A.V Kostochka |
|---|---|
| Editors | |
| Type | article |
| Year | 1977 |
| Citekey | borodin1977upper |
Where it appeared
| Published in | Journal of Combinatorial Theory, Series B |
|---|---|
| Publisher | Elsevier BV |
| Volume | 23 |
| Issue | 2-3 |
| Pages | 247--250 |
Identifiers
| DOI | 10.1016/0095-8956(77)90037-5 |
|---|---|
| ISSN | 0095-8956 |
Access
| Landing page | https://doi.org/10.1016/0095-8956(77)90037-5 |
|---|
How it got here
| How it got here | agent via crossref |
|---|---|
| Added | 2026-10-23 16:47 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@article{borodin1977upper,
title = {On an upper bound of a graph's chromatic number, depending on the graph's degree and density},
author = {O.V Borodin and A.V Kostochka},
year = {1977},
journal = {Journal of Combinatorial Theory, Series B},
publisher = {Elsevier BV},
volume = {23},
number = {2-3},
pages = {247--250},
issn = {0095-8956},
doi = {10.1016/0095-8956(77)90037-5},
}
This record lives at https://refs.drheap.org/borodin1977upper/ and will keep doing so.