55 citations · 324 across the 27 of their papers we have counts for
1 paper · 2 filters
Přemysl Holub, Borut Lužar, Erika Mihaliková +2
A star edge-coloring of a graph G is a proper edge-coloring without bichromatic paths or cycles of length four. The smallest integer k such that G admits a star edge-coloring…