pith. sign in

arxiv: 1604.06504 · v1 · pith:OWF6MBZJnew · submitted 2016-04-21 · 🧮 math.CO

The chromatic number of the square of subcubic planar graphs

Stephen G. Hartke , Sogol Jahanbekam , Brent Thomas This is my paper
classification 🧮 math.CO
keywords planarsquarechromaticcolorablecomputationalconfigurationsconjectureconjectured
0
0 comments X
read the original abstract

Wegner conjectured in 1977 that the square of every planar graph with maximum degree at most $3$ is $7$-colorable. We prove this conjecture using the discharging method and computational techniques to verify reducible configurations.

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 2 Pith papers

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

  1. Subcubic $K_4$-minor-free graphs without crumby colorings

    math.CO 2026-05 unverdicted novelty 7.0

    Counterexamples disprove the conjecture that every K4-minor-free graph has a crumby coloring, with the smallest connected one having 18 vertices and a 2-connected one having 40 vertices.

  2. 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.