Name
Abstract | ||
|---|---|---|
The vertex-arboricity a(G) of a graph G is the minimum number of colors required to color the vertices of G such that no cycle is monochromatic. The list vertex-arboricity a(l)(G) is the list version of this concept. In this paper, we prove the following results: (i) If G is a planar graph without 7-cycles, then a(l)(G) <=& nbsp;2; (ii) If G is a planar graph without 8-cycles and adjacent 3-cycles, then a(l)(G) <=& nbsp;2. The result (i) extends a result in Huang et al. (2012) [12], which says that every planar graph G without 7-cycles has a(G) <=& nbsp;2.(C) 2022 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.disc.2022.112865 | DISCRETE MATHEMATICS |
Keywords | DocType | Volume |
Planar graph, List vertex-arboricity, List-forested-coloring, Cycle | Journal | 345 |
Issue | ISSN | Citations |
6 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yiqiao Wang | 1 | 494 | 42.81 |
| Yanping Yang | 2 | 0 | 0.34 |
| Danjun Huang | 3 | 0 | 1.01 |
| Weifan Wang | 4 | 868 | 89.92 |