The square of a planar cubic graph is 7-colorable
From MaRDI portal
Publication:1682215
DOI10.1016/j.jctb.2017.08.010zbMath1375.05110arXiv1708.04406OpenAlexW2963408654WikidataQ56926479 ScholiaQ56926479MaRDI QIDQ1682215
Publication date: 28 November 2017
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.04406
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
2-distance list \((\Delta +2)\)-coloring of planar graphs with girth at least 10 ⋮ Exact square coloring of subcubic planar graphs ⋮ Graph \(r\)-hued colorings -- a survey ⋮ Connectivity of minimum non-5-injectively colorable planar cubic graphs ⋮ An optimal square coloring of planar graphs ⋮ 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 ⋮ Coloring the square of maximal Planar graphs with diameter two ⋮ Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth ⋮ Bounding the chromatic number of squares of \(K_4\)-minor-free graphs ⋮ Crumby colorings -- red-blue vertex partition of subcubic graphs regarding a conjecture of Thomassen ⋮ 2-distance coloring of planar graphs without adjacent 5-cycles ⋮ Coloring squares of planar graphs with maximum degree at most five ⋮ 2-distance choosability of planar graphs with a restriction for maximum degree ⋮ A survey on the cyclic coloring and its relaxations ⋮ List-coloring the square of a subcubic graph ⋮ \(r\)-hued \((r+1)\)-coloring of planar graphs with girth at least 8 for \(r\geq 9\) ⋮ Decomposition of cubic graphs related to Wegner's conjecture ⋮ Coloring squares of graphs with mad constraints ⋮ The complexity of frugal colouring ⋮ Counterexamples to Thomassen's conjecture on decomposition of cubic graphs ⋮ 2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles ⋮ 2-distance list \((\varDelta +3)\)-coloring of sparse graphs ⋮ Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods ⋮ Coloring squares of graphs via vertex orderings
Cites Work
