Star edge coloring of some classes of graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F16%3A43924554" target="_blank" >RIV/49777513:23520/16:43924554 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1002/jgt.21862" target="_blank" >http://dx.doi.org/10.1002/jgt.21862</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/jgt.21862" target="_blank" >10.1002/jgt.21862</a>
Alternative languages
Result language
angličtina
Original language name
Star edge coloring of some classes of 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 article, we establish tight upper bounds for trees and subcubic outerplanar graphs, and derive an upper bound for outerplanar graphs.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/EE2.3.30.0038" target="_blank" >EE2.3.30.0038: New excellence in human resources</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2016
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
1097-0118
e-ISSN
—
Volume of the periodical
81
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
10
Pages from-to
73-82
UT code for WoS article
000366308600007
EID of the result in the Scopus database
—