Strong chromatic index of K-1,t-free graphs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F20%3A00126001" target="_blank" >RIV/00216224:14330/20:00126001 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1016/j.dam.2020.03.024" target="_blank" >https://doi.org/10.1016/j.dam.2020.03.024</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2020.03.024" target="_blank" >10.1016/j.dam.2020.03.024</a>

Result language
angličtina
Original language name
Strong chromatic index of K-1,t-free graphs
Original language description
A strong edge-coloring of a graph G is a coloring of the edges of G such that each color class is an induced matching. The strong chromatic index of G is the minimum number of colors in a strong edge-coloring of G. We show that the strong chromatic index of a claw-free graph with maximum degree Delta is at most 1.125 Delta(2) + Delta, which confirms the conjecture of Erdos and Negetfil from 1985 for this class of graphs for Delta >= 12. We also prove an upper bound of (2 - 1/t-2 ) Delta(2) on strong chromatic index of K-1,K-t-free graphs with maximum degree Delta for all t >= 4 and give an improved result 1.625 Delta(2) for unit disk graphs.
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
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

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

Similar results(10)