Resistance in Regular Class Two Graphs

Abstract A well-known theorem of Vizing separates graphs into two classes: those which admit proper Δ-edge-colourings, known as class one graphs; and those which do not, known as class two graphs. Class two graphs do admit proper (Δ+ 1)-edge-colourings. In the context of snarks (class two cubic graphs), there has recently been much focus on parameters which are said to measure how far the snark is from being 3-edge-colourable, and there are thus many well-known lemmas and results which are widely used in the study of snarks. These parameters, or so-called measurements of uncolourability, have thus far evaded consideration in the general case of k-regular class two graphs for k > 3. Two such measures are the resistance and vertex resistance of a graph. For a graph G, the (vertex) resistance of G, denoted as (rv(G)) r(G), is defined as the minimum number of (vertices) edges which need to be removed from G in order to render it class one. In this paper, we generalise some of the well-known lemmas and results to the k-regular case. For the main result of this paper, we generalise the known fact that r(G) = rv(G) if G is a snark by proving the following bounds for k-regular G:rv(G)≤r(G)≤⌊ k2 ⌋rv(G) G:{r_v}\left( G \right) \le r\left( G \right) \le \left\lfloor {{k \over 2}} \right\rfloor {r_v}\left( G \right) . Moreover, we show that both bounds are best possible for any even k.