The list 2-distance coloring of a graph with Δ(G) = 5

Yuehua Bu, Xia Lv, Xiaoyan Yan

Source record

Source: Crossref

Published: May 25, 2015

DOI: 10.1142/s1793830915500172

Open original source ↗

Source abstract

We study the list 2-distance coloring of a graph G, and its maximum average degree, denoted mad (G). For Δ(G) = 5, we proved that [Formula: see text], [Formula: see text], [Formula: see text] and ch 2 (G) ≤ 11 if mad (G) < 3 respectively, where ch 2 (G) is the list 2-distance chromatic number.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.