An easy counting argument shows tha

An easy counting argument shows that if G is overfull then |V (G)| must be odd and G is Class 2 (in every edgecolouring
at most 1/2(|V (G)|−1) edges of G can have the same colour). If G is not overfull but it contains an overfull
subgraph H with
(H) =
(G), then G is Class 2.

ผลลัพธ์ (อังกฤษ) 2:

An easy counting argument shows that if G is overfull then | V (G) |. Odd must be Class 2 and G is (in every Edgecolouring
Most at 1/2 (| V (G) | -1) edges of G Can have the Same Colour). If G is not Overfull but it contains an Overfull
subgraph H with? (H) =? (G), then G is Class 2.