DeepAI AI Chat
Log In Sign Up

Dynamic list coloring of 1-planar graphs

by   Xin Zhang, et al.
Xidian University

A graph is k-planar if it can be drawn in the plane so that each edge is crossed at most k times. Typically, the class of 1-planar graphs is among the most investigated graph families within the so-called "beyond planar graphs". A dynamic ℓ-list coloring of a graph is a proper coloring so that each vertex receives a color from a list of ℓ distinct candidate colors assigned to it, and meanwhile, there are at least two colors appearing in the neighborhood of every vertex of degree at least two. In this paper, we prove that each 1-planar graph has a dynamic 11-list coloring. Moreover, we show a relationship between the dynamic coloring of 1-planar graphs and the proper coloring of 2-planar graphs, which states that the dynamic (list) chromatic number of the class of 1-planar graphs is at least the (list) chromatic number of the class of 2-planar graphs.


page 1

page 2

page 3

page 4


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

Given a graph G and a list assignment L(v) for each vertex of v of G. A ...

A structure of 1-planar graph and its applications to coloring problems

A graph is 1-planar if it can be drawn on a plane so that each edge is c...

Distributed coloring in sparse graphs with fewer colors

This paper is concerned with efficiently coloring sparse graphs in the d...

Flexibility of Planar Graphs – Sharpening the Tools to Get Lists of Size Four

A graph where each vertex v has a list L(v) of available colors is L-col...

Improved Bounds for Track Numbers of Planar Graphs

A track layout of a graph consists of a vertex coloring and of a total o...

Planar Ramsey graphs

We say that a graph H is planar unavoidable if there is a planar graph G...

Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces

In 1994, Thomassen proved that every planar graph is 5-list-colorable. I...