Minimum number of palettes in edge colorings

DOI10.1007/S00373-013-1298-8MaRDI QIDQ2014713zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Mirko Horňák, Rafał Kalinowski, Mariusz Meszka, Mariusz Woźniak

Publication date 16 June 2014

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00373-013-1298-8

zbMATH Keywords

edge colouringpalette of a vertex

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Edge-colorings of 4-regular graphs with the minimum number of palettes
• Parsimonious edge coloring
• Minimum multiplicity edge coloring via orientation
• On the minimal number of edges in color-critical graphs
• Publication:3469116
• Minimum sum edge colorings of multicycles
• Minimal sufficient sets of colors and minimum number of colors
• Parsimonious edge-coloring on surfaces
• Coloring Graphs with Minimal Edge Load
• Edge coloring graphs with large minimum degree

Cites work

• scientific article; zbMATH DE number 1229733 (Why is no real title available?)
• scientific article; zbMATH DE number 907924 (Why is no real title available?)
• On the neighbour-distinguishing index of a graph
• Vertex-distinguishing proper edge-colorings

Cited in

(15)

• Even cycle decompositions of index 3 by a novel coloring technique
• Colorful edge decomposition of graphs: some polynomial cases
• On the palette index of complete bipartite graphs
• On the minimum number of bond-edge types and tile types: an approach by edge-colorings of graphs
• A note on one-sided interval edge colorings of bipartite graphs
• ON THE PALETTE INDEX OF GRAPHS HAVING A SPANNING STAR
• How to personalize the vertices of a graph?
• Even cycles and even 2-factors in the line graph of a simple graph
• \(H\)-colorings for 4-regular graphs
• Graphs with large palette index
• Two results on the palette index of graphs
• The palette index of Sierpiński triangle graphs and Sierpiński graphs
• Parsimonious edge coloring
• A family of multigraphs with large palette index
• Edge-colorings of 4-regular graphs with the minimum number of palettes

This page was built for publication: Minimum number of palettes in edge colorings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014713)