On 2-Distance (+4)-coloring of planar graphs with girth at least five

Abstract

A vertex coloring of a graph G is called a 2-distance coloring if any two vertices at distance at most 2 from each other receive different colors. Let G be a planar graph with girth at least 5. We prove that G admits a 2-distance coloring with +4 colors if ≥ 22.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…