Note on incidence chromatic number of subquartic graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10367465" target="_blank" >RIV/00216208:11320/17:10367465 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s10878-016-0072-2" target="_blank" >http://dx.doi.org/10.1007/s10878-016-0072-2</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s10878-016-0072-2" target="_blank" >10.1007/s10878-016-0072-2</a>

Result language
angličtina
Original language name
Note on incidence chromatic number of subquartic graphs
Original language description
An incidence in a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G incident to v. Two incidences (v, e) and (u, f) are adjacent if at least one of the following holds: (a) v=u, (b) e=f, or (c) vu in {e, f}. An incidence coloring of G is a coloring of its incidences assigning distinct colors to adjacent incidences. In this note we prove that every subquartic graph admits an incidence coloring with at most seven colors.
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
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA14-10799S" target="_blank" >GA14-10799S: Hybercubic, graph and hypergraph structures</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)