Incidence coloring - cold cases

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F20%3A43952785" target="_blank" >RIV/49777513:23520/20:43952785 - isvavai.cz</a>
Result on the web
<a href="https://www.dmgt.uz.zgora.pl/publish/view_pdf.php?ID=15958" target="_blank" >https://www.dmgt.uz.zgora.pl/publish/view_pdf.php?ID=15958</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.7151/dmgt.2140" target="_blank" >10.7151/dmgt.2140</a>

Result language
angličtina
Original language name
Incidence coloring - cold cases
Original language description
The minimum number of colors needed for incidence coloring of a graph is called the incidence chromatic number. In this paper we present some results on graphs regarding their maximum degree and maximum average degree. We improve the bound for planar graphs with Delta(G) = 6. We show that the incidence chromatic number is at most Delta(G) + 2 for any graph G with mad(G) < 3 and Delta(G) = 4, and for any graph with mad(G) < 10/3 and Delta(G) >= 8.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)