An edge coloring problem for graph products

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199611)23:3<297::AID-JGT9>3.0.CO;2-N" /><297::AID-JGT9>3.0.CO;2-N 10.1002/(SICI)1097-0118(199611)23:3<297::AID-JGT9>3.0.CO;2-NzbMath0859.05043OpenAlexW4244845592MaRDI QIDQ4715283

Richard H. Schelp, Ralph J. Faudree, András Gyárfás

Publication date: 7 April 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199611)23:3<297::aid-jgt9>3.0.co;2-n

zbMATH Keywords

chromatic numberCartesian productedge coloringsrainbow coloringgood coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Proper edge colorings of Cartesian products with rainbow \(C_4\)-s

This page was built for publication: An edge coloring problem for graph products