Edge-colorings of 4-regular graphs with the minimum number of palettes

DOI10.1007/s00373-015-1658-7zbMath1345.05025OpenAlexW2253311773MaRDI QIDQ2631073

Giuseppe Mazzuoccolo, Simona Bonvicini

Publication date: 28 July 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11380/1102906

zbMATH Keywords

edge-coloringeven cycle decomposition4-regular graphspalette indexeven 2-factor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (9)

ON THE PALETTE INDEX OF GRAPHS HAVING A SPANNING STAR ⋮ Even cycle decompositions of index 3 by a novel coloring technique ⋮ 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 ⋮ Graphs with large palette index

Cites Work

• Unnamed Item
• Even cycle decompositions of 4-regular graphs and line graphs
• On the neighbour-distinguishing index of a graph
• Coloring graphs with locally few colors
• Minimum number of palettes in edge colorings
• Local chromatic number and Sperner capacity
• Almost all regular graphs are hamiltonian
• Vertex-distinguishing proper edge-colorings

This page was built for publication: Edge-colorings of 4-regular graphs with the minimum number of palettes