2-distance list (Δ+2)-coloring of planar graphs with girth at least 10

09/29/2021
by   Hoang La, et al.
0

Given a graph G and a list assignment L(v) for each vertex of v of G. A proper L-list-coloring of G is a function that maps every vertex to a color in L(v) such that no pair of adjacent vertices have the same color. We say that a graph is list k-colorable when every vertex v has a list of colors of size at least k. A 2-distance coloring is a coloring where vertices at distance at most 2 cannot share the same color. We prove the existence of a 2-distance list (Δ+2)-coloring for planar graphs with girth at least 10 and maximum degree Δ≥ 4.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/04/2021

2-distance list (Δ+ 3)-coloring of sparse graphs

A 2-distance list k-coloring of a graph is a proper coloring of the vert...
research
11/25/2019

Dynamic list coloring of 1-planar graphs

A graph is k-planar if it can be drawn in the plane so that each edge is...
research
09/13/2022

List recoloring of planar graphs

A list assignment L of a graph G is a function that assigns to every ver...
research
12/31/2018

Choosability in bounded sequential list coloring

The list coloring problem is a variation of the classical vertex colorin...
research
12/05/2018

Graph multicoloring reduction methods and application to McDiarmid-Reed's Conjecture

A (a,b)-coloring of a graph G associates to each vertex a set of b color...
research
04/04/2019

Quasi-polynomial Algorithms for List-coloring of Nearly Intersecting Hypergraphs

A hypergraph H on n vertices and m edges is said to be nearly-intersect...
research
06/20/2022

List Colouring Trees in Logarithmic Space

We show that List Colouring can be solved on n-vertex trees by a determi...

Please sign up or login with your details

Forgot password? Click here to reset