Minimum number of palettes in edge colorings
From MaRDI portal
Publication:2014713
DOI10.1007/s00373-013-1298-8zbMath1291.05066OpenAlexW2093508050WikidataQ59397536 ScholiaQ59397536MaRDI QIDQ2014713
Rafał Kalinowski, Mariusz Meszka, Mirko Horňák, Mariusz Woźniak
Publication date: 16 June 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1298-8
Related Items (13)
ON THE PALETTE INDEX OF GRAPHS HAVING A SPANNING STAR ⋮ Edge-colorings of 4-regular graphs with the minimum number of palettes ⋮ Even cycle decompositions of index 3 by a novel coloring technique ⋮ Colorful edge decomposition of graphs: some polynomial cases ⋮ A note on one-sided interval edge colorings of bipartite graphs ⋮ Even cycles and even 2-factors in the line graph of a simple graph ⋮ TWO RESULTS ON THE PALETTE INDEX OF GRAPHS ⋮ \(H\)-colorings for 4-regular graphs ⋮ On the palette index of complete bipartite graphs ⋮ Unnamed Item ⋮ A family of multigraphs with large palette index ⋮ On the minimum number of bond-edge types and tile types: an approach by edge-colorings of graphs ⋮ Graphs with large palette index
Cites Work
This page was built for publication: Minimum number of palettes in edge colorings
