Abstract
The monochromatic connectivity of 3-chromatic graphs
Highlights
An edge-coloring of a connected graph is a monochromatically connecting coloring (MCcoloring, for short) if there is a monochromatic path joining any two vertices
Suppose that f consists of k nontrivial color trees, denoted by then V1 ⊆ V (T1), ..., Tk, where ti = |V (Ti)|
There are vertices that appear in unique nontrivial color trees
Summary
An edge-coloring of a connected graph is a monochromatically connecting coloring (MCcoloring, for short) if there is a monochromatic path joining any two vertices. If G is a connected spanning subgraph of some graph H and let mc(G) = m(G) − n(G) + k1, mc(H) = m(H) − n(H) + k2, k1 ≤ k2. Suppose that f consists of k nontrivial color trees, denoted by T1, ..., Tk, where ti = |V (Ti)|.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
