List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles

DOI10.1007/s10878-018-0312-8zbMath1410.05030MaRDI QIDQ1631690

Haiyang Zhu, Yu Gu, Jingjun Sheng, Xin-zhong Lü

Publication date: 6 December 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0312-8

zbMATH Keywords

planar graph; 2-distance coloring; Wegner's conjecture; list \(L(2, 1)\)-labeling

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

05C12: Distance in graphs

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

Cites Work

• Unnamed Item
• Unnamed Item
• Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
• The \(L(p, q)\)-labelling of planar graphs without 4-cycles
• Graph labellings with variable weights, a survey
• Choosability of the square of planar subcubic graphs with large girth
• List \((p,q)\)-coloring of sparse plane graphs
• Coloring squares of planar graphs with girth six
• A unified approach to distance-two colouring of graphs on surfaces
• A survey on the distance-colouring of graphs
• A bound on the chromatic number of the square of a planar graph
• Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
• Labeling Planar Graphs without 4,5-Cycles with a Condition on Distance Two
• List Colouring Squares of Planar Graphs
• On the total coloring of planar graphs.
• Coloring the square of a planar graph
• List‐Coloring the Squares of Planar Graphs without 4‐Cycles and 5‐Cycles
• Choosability conjectures and multicircuits