In this paper, we first give some upper bounds on the number of edges for two classes of planar graphs. Then using these upper bounds, we obtain some sufficient conditions for a planar graph to be of Class 1.
|Number of pages||5|
|Publication status||Published - Dec 1999|
- chromatic index
- planar graph
- Class 1 graph