Proper edge colorings of planar graphs with rainbow C4 ${C}_{4}$‐s
András Gyárfás,
Ryan R. Martin,
Miklós Ruszinkó
et al.
Abstract:We call a proper edge coloring of a graph a B‐coloring if every 4‐cycle of is colored with four different colors. Let denote the smallest number of colors needed for a B‐coloring of . Motivated by earlier papers on B‐colorings, here we consider for planar and outerplanar graphs in terms of the maximum degree . We prove that for planar graphs, for bipartite planar graphs, and for outerplanar graphs with . We conjecture that, for sufficiently large, for planar , and for outerplanar .
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.