Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 201-205 |
| Number of pages | 5 |
| Journal | Congressus Numerantium |
| Volume | 136 |
| Publication status | Published - Dec 1999 |
User-Defined Keywords
- chromatic index
- planar graph
- Class 1 graph