Note on list star edge‐coloring 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%2F19%3A43952790" target="_blank" >RIV/49777513:23520/19:43952790 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1002/jgt.22402" target="_blank" >https://doi.org/10.1002/jgt.22402</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/jgt.22402" target="_blank" >10.1002/jgt.22402</a>
Alternative languages
Result language
angličtina
Original language name
Note on list star edge‐coloring 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. In this paper, we consider the list version of this coloring and prove that the list star chromatic index of every subcubic graph is at most 7.
Czech name
—
Czech description
—
Classification
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
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
2019
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
Journal of Graph Theory
ISSN
0364-9024
e-ISSN
—
Volume of the periodical
90
Issue of the periodical within the volume
3
Country of publishing house
US - UNITED STATES
Number of pages
7
Pages from-to
304-310
UT code for WoS article
000463967200006
EID of the result in the Scopus database
2-s2.0-85052786704