Name
Abstract | ||
|---|---|---|
A unique-maximum k-coloring with respect to faces of a plane graph G is a coloring with colors 1, ..., k so that, for each face a of G, the maximum color occurs exactly once on the vertices of a. We prove that any plane graph is unique-maximum 3-colorable and has a proper unique-maximum coloring with 6 colors. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.7151/dmgt.1846 | DISCUSSIONES MATHEMATICAE GRAPH THEORY |
Keywords | Field | DocType |
plane graph,weak-parity coloring,unique-maximum coloring | Complete coloring,Discrete mathematics,Edge coloring,Combinatorics,Indifference graph,List coloring,Brooks' theorem,Greedy coloring,1-planar graph,Mathematics,Graph coloring | Journal |
Volume | Issue | ISSN |
36 | 1 | 1234-3099 |
Citations | PageRank | References |
3 | 0.49 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Igor Fabrici | 1 | 101 | 14.64 |
| Frank Göring | 2 | 53 | 9.00 |