Minimum degree conditions for the Overfull Conjecture for odd order graphs.
Kerstin Bongard, Arne Hoffmann, Lutz Volkmann · 2003
The Overfull Conjecture states that a graph G with 3∆(G) ≥ n(G) is Class 2 if and only if it has a ∆(G)-overfull subgraph. M. Plantholt showed that the Overfull Conjecture is true for graphs with even order and high minimum degree. In this paper we look at graphs with odd order and show under which restrictions the Overfull Conjecture holds true for these. 1