On a star chromatic index of subcubic graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F17%3A43932829" target="_blank" >RIV/49777513:23520/17:43932829 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.endm.2017.07.043" target="_blank" >http://dx.doi.org/10.1016/j.endm.2017.07.043</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.endm.2017.07.043" target="_blank" >10.1016/j.endm.2017.07.043</a>
Alternative languages
Result language
angličtina
Original language name
On a star chromatic index of subcubic graphs
Original language description
A star edge-coloring of a graph is a proper edge-coloring without bichromatic paths and cycles of length four. We consider the list version of this coloring and prove that the list star chromatic index of every subcubic graph is at most 7, answering the question of Dvořák, Mohar and Šámal published in 2013.
Czech name
—
Czech description
—
Classification
Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
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)
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Electronic Notes in Discrete Mathematics
ISSN
1571-0653
e-ISSN
—
Volume of the periodical
61
Issue of the periodical within the volume
August 2017
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
5
Pages from-to
835-839
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-85026771377