A sufficient condition for a planar graph to be class 1
We prove that every planar graph G with Delta = 6 is of Class 1 if it does not contain a 5-cycle with a chord. (c) 2007 Elsevier B.V. All rights reserved.
planar graph edge colouring chromatic index cycle