WorksMathematics
Quasi-Bisections of Cubic Graphs with Tree and Circuit Decompositions
Abstract
A -quasi-bisection of a graph is a vertex -coloring in which the color classes differ in size by at most two and every monochromatic component has at most two vertices. Esperet, Mazzuoccolo, and Tarsi in [J. Graph Theory, 86(2017), 149-158] conjectured that every cubic graph admits such a coloring. DeVos and Nurse proved the conjecture for cubic graphs whose edge sets can be partitioned into a tree and a circuit. This result is generalized in this paper for a larger family of cubic graphs. The conjecture is verified for cubic graphs whose edge set can be partitioned into two subsets and , where is a tree of and is an even subgraph containing at most two odd circuit components.