We prove a conjecture of Dvorak, Kral, Nejedly, and Skrekovski that planar graphs of girth at least five with maximum degree A are square (Delta + 2)-colorable for large enough Delta. In fact, we prove the stronger statement that such graphs are square (Delta + 2)-choosable and even square (Delta + 2)-paintable. (C) 2018 Elsevier Inc. All rights reserved.
机构:
TEL AVIV UNIV,RAYMOND & BEVERLY SACKLER FAC EXACT SCI,SCH MATH SCI,DEPT COMP SCI,IL-69978 TEL AVIV,ISRAELTEL AVIV UNIV,RAYMOND & BEVERLY SACKLER FAC EXACT SCI,SCH MATH SCI,DEPT COMP SCI,IL-69978 TEL AVIV,ISRAEL
ALON, N
TARSI, M
论文数: 0引用数: 0
h-index: 0
机构:
TEL AVIV UNIV,RAYMOND & BEVERLY SACKLER FAC EXACT SCI,SCH MATH SCI,DEPT COMP SCI,IL-69978 TEL AVIV,ISRAELTEL AVIV UNIV,RAYMOND & BEVERLY SACKLER FAC EXACT SCI,SCH MATH SCI,DEPT COMP SCI,IL-69978 TEL AVIV,ISRAEL
机构:
TEL AVIV UNIV,RAYMOND & BEVERLY SACKLER FAC EXACT SCI,SCH MATH SCI,DEPT COMP SCI,IL-69978 TEL AVIV,ISRAELTEL AVIV UNIV,RAYMOND & BEVERLY SACKLER FAC EXACT SCI,SCH MATH SCI,DEPT COMP SCI,IL-69978 TEL AVIV,ISRAEL
ALON, N
TARSI, M
论文数: 0引用数: 0
h-index: 0
机构:
TEL AVIV UNIV,RAYMOND & BEVERLY SACKLER FAC EXACT SCI,SCH MATH SCI,DEPT COMP SCI,IL-69978 TEL AVIV,ISRAELTEL AVIV UNIV,RAYMOND & BEVERLY SACKLER FAC EXACT SCI,SCH MATH SCI,DEPT COMP SCI,IL-69978 TEL AVIV,ISRAEL