On M_f-edge colorings of graphs
From MaRDI portal
Publication:2158189
DOI10.7151/DMGT.2329zbMATH Open1504.05092OpenAlexW3032867318MaRDI QIDQ2158189FDOQ2158189
Authors: 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
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Edge-colorings with no large polychromatic stars
- Rainbow generalizations of Ramsey theory: A survey
- Approximation algorithm for maximum edge coloring
- The min-max edge \(q\)-coloring problem
- Approximation and hardness results for the maximum edge \(q\)-coloring problem
- On totally multicolored stars
- On \(N_2\)-vertex coloring of graphs
- \(M_2\)-edge coloring and maximum matching of graphs
- \(M_i\)-edge colorings of graphs
- A note on M2-edge colorings of graphs
- \(\mathrm{M}_2\)-edge colorings of cacti and graph joins
- \(\mathrm{M}_2\)-edge colorings of dense graphs
Cited In (7)
This page was built for publication: On \(\mathrm{M}_f\)-edge colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158189)