Name
Abstract | ||
|---|---|---|
The rainbowness, rb(G), of a connected plane graph G is the minimum number k such that any colouring of vertices of the graph G using at least k colours involves a face all vertices of which receive distinct colours. For a connected cubic plane graph G we prove that n2+α1*-1⩽rb(G)⩽n-α0*+1,where α0* and α1* denote the independence number and the edge independence number, respectively, of the dual graph G* of G. We also prove that if the dual graph G* of an n-vertex cubic 3-connected plane graph G has a perfect matching then rb(G)=34n. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.disc.2006.06.012 | Discrete Mathematics |
Keywords | DocType | Volume |
05C15,52B10 | Journal | 306 |
Issue | ISSN | Citations |
24 | 0012-365X | 5 |
PageRank | References | Authors |
0.62 | 2 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Stanislav Jendrol’ | 1 | 67 | 7.66 |