We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
List 2-Distance Coloring of Planar Graphs with Neither 3-Cycles Nor Intersect 4-Cycles.
- Authors
Wen-juan Zhou; Lei Sun
- Abstract
A coloring ϕ: V (G) → {1, 2, ..., k} of G is 2- distance if any two vertices at distance at most two from each other get different colors. If every vertex v of G has its own set L(v) of admissible colors where |L(v)| ≥ k, then we say that V (G) has a list L of size k. A graph G is said to be list 2-distance k-colorable if any list L of size k allows a 2- distance coloring ϕ such that ϕ(v)∈ L(v) whenever v ∈ V (G). In this paper, we proved that: Every planar graph with neither 3-cycles nor intersect 4-cycles and ∆(G) ≥ 18 is list 2-distance (∆ + 8)-colorable.
- Subjects
PLANAR graphs; GRAPH coloring; COLORING matter; COLORS
- Publication
IAENG International Journal of Applied Mathematics, 2022, Vol 52, Issue 1, p110
- ISSN
1992-9978
- Publication type
Article