On \(\mathrm{M}_f\)-edge colorings of graphs

DOI10.7151/dmgt.2329zbMath1504.05092OpenAlexW3032867318MaRDI QIDQ2158189

Jaroslav Ivančo, Alfréd Onderko

Publication date: 26 July 2022

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2329

zbMATH Keywords

edge coloringdominating setanti-Ramsey number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation and hardness results for the maximum edge \(q\)-coloring problem
• Rainbow generalizations of Ramsey theory: A survey
• \(\mathrm{M}_2\)-edge colorings of cacti and graph joins
• Approximation algorithm for maximum edge coloring
• Edge-colorings with no large polychromatic stars
• M_{2}-edge colorings of dense graphs
• The Min-Max Edge q-Coloring Problem
• A note on M2-edge colorings of graphs
• On N2-vertex coloring of graphs
• On totally multicolored stars

This page was built for publication: On \(\mathrm{M}_f\)-edge colorings of graphs