Star Chromatic Index

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10159002" target="_blank" >RIV/00216208:11320/13:10159002 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1002/jgt.21644" target="_blank" >http://dx.doi.org/10.1002/jgt.21644</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/jgt.21644" target="_blank" >10.1002/jgt.21644</a>

Result language
angličtina
Original language name
Star Chromatic Index
Original language description
The star chromatic index chi'_s(G) of a graph G is the minimum number of colors needed to properly color the edges of the graph so that no path or cycle of length four is bi-colored. We obtain a near-linear upper bound in terms of the maximum degree Delta=Delta(G). Our best lower bound on chi'_s in terms of Delta is 2Delta(1+o(1)) valid for complete graphs. We also consider the special case of cubic graphs, for which we show that the star chromatic index lies between 4 and 7 and characterize the graphsattaining the lower bound. The proofs involve a variety of notions from other branches of mathematics and may therefore be of certain independent interest.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

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
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)