Name
Abstract | ||
|---|---|---|
An acyclic coloring of a graph is a proper coloring of the graph, for which every cycle uses at least three colors. Let G4 be the set of maximal planar graphs of minimum degree 4, such that each graph in G4 contains exactly four odd-vertices and the subgraph induced by the four odd-vertices contains a quadrilateral. In this article, we show that every acyclic 4-coloring of a maximal planar graph with exact four odd-vertices is locally equitable with regard to its four odd-vertices. Moreover, we obtain a necessary and sufficient condition for a graph in G4 to be acyclically 4-colorable, and give an enumeration of the acyclically 4-colorable graphs in G4.
|
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.amc.2018.02.015 | Applied Mathematics and Computation |
Keywords | Field | DocType |
05C15, Acyclically coloring, Enumeration, Locally equitable coloring, Maximal planar graphs, Necessary and sufficient condition | Graph,Combinatorics,Mathematical analysis,Enumeration,Quadrilateral,Mathematics,Planar graph,Acyclic coloring | Journal |
Volume | ISSN | Citations |
329 | 0096-3003 | 1 |
PageRank | References | Authors |
0.35 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Enqiang Zhu | 1 | 25 | 11.99 |
| Zepeng Li | 2 | 20 | 9.07 |
| Zehui Shao | 3 | 119 | 30.98 |
| Jin Xu | 4 | 230 | 45.13 |