A path in an edge-colored graph is called monochromatic if all the edges in the path have the same color. An edge-coloring of a connected graph G is called a monochromatic connection coloring (MC-coloring for short) if any two vertices of G are connected by a monochromatic path in G. For a connected graph G, the monochromatic connection number (MC-number for short) of G, denoted by mc(G), is the maximum number of colors that ensure G has a monochromatic connection coloring by using this number of colors. This concept was introduced by Caro and Yuster in 2011. They proved that mcwhere κ(G) is the connectivity of G. We also prove that mc(G) ≤ m − n + 4 if G is a planar graph, and classify all planar graphs by their monochromatic connection numbers.
An edge-coloring of a connected graph G is called a monochromatic connection coloring (MC-coloring for short) if any two vertices of G are connected by a monochromatic path in G. For a connected graph G, the monochromatic connection number (MC-number for short) of G, denoted by mc(G), is the maximum number of colors that ensure G has a monochromatic connection coloring by using this number of colors. This concept was introduced by Caro and Yuster in 2011. They proved that mc(G)In this paper we depict all graphs with mc(G)We also prove that mc(G) ≤ m − n + 4 if G is a planar graph, and classify all planar graphs by their monochromatic connectivity numbers.
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.