| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436055 | Theoretical Computer Science | 2007 | 7 Pages |
Abstract
We prove that every planar graph G with Δ=6 is of Class 1 if it does not contain a 5-cycle with a chord.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
