Minimum number of palettes in edge colorings
From MaRDI portal
Publication:2014713
DOI10.1007/S00373-013-1298-8zbMATH Open1291.05066DBLPjournals/gc/HornakKMW14OpenAlexW2093508050WikidataQ59397536 ScholiaQ59397536MaRDI QIDQ2014713FDOQ2014713
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)
Full work available at URL: https://doi.org/10.1007/s00373-013-1298-8
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
Cited In (15)
- How to personalize the vertices of a graph?
- Graphs with large palette index
- The palette index of Sierpiński triangle graphs and Sierpiński graphs
- Edge-colorings of 4-regular graphs with the minimum number of palettes
- On the minimum number of bond-edge types and tile types: an approach by edge-colorings of graphs
- Parsimonious edge coloring
- A note on one-sided interval edge colorings of bipartite graphs
- Even cycle decompositions of index 3 by a novel coloring technique
- \(H\)-colorings for 4-regular graphs
- Even cycles and even 2-factors in the line graph of a simple graph
- On the palette index of complete bipartite graphs
- A family of multigraphs with large palette index
- ON THE PALETTE INDEX OF GRAPHS HAVING A SPANNING STAR
- Colorful edge decomposition of graphs: some polynomial cases
- Two results on the palette index of graphs
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)