Name
Abstract | ||
|---|---|---|
The conjecture of Dirac that every 4-critical planar graph has a vertex of degree at most 4 was recently proved by Koester. In this article a different proof is given. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0012-365X(94)90245-3 | Discrete Mathematics |
Keywords | Field | DocType |
4-critical planar graph,planar graph | Grinberg's theorem,Discrete mathematics,Outerplanar graph,Combinatorics,Forbidden graph characterization,Planar straight-line graph,Nowhere-zero flow,Apex graph,Universal graph,Mathematics,Planar graph | Journal |
Volume | Issue | ISSN |
132 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.40 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| H. L. Abbott | 1 | 85 | 26.84 |
| M. Katchalski | 2 | 121 | 30.17 |
| B. Zhou | 3 | 51 | 12.04 |