pith. sign in

arxiv: 1708.04406 · v1 · pith:TLUVJ54Enew · submitted 2017-08-15 · 🧮 math.CO

The square of a planar cubic graph is 7-colorable

Carsten Thomassen This is my paper
classification 🧮 math.CO
keywords colorablecubicgraphplanarsquarecannotconjectureevery
0
0 comments X
read the original abstract

We prove the conjecture made by G.Wegner in 1977 that the square of every planar, cubic graph is $7$-colorable. Here, $7$ cannot be replaced by $6$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)

    math.CO 2022-10 unverdicted

    This is a survey compiling results on strong edge-coloring and related coloring problems for squares of graphs in planar and sparse classes.