DeepAI AI Chat
Log In Sign Up

Square coloring planar graphs with automatic discharging

by   Nicolas Bousquet, et al.

The discharging method is a powerful proof technique, especially for graph coloring problems. Its major downside is that it often requires lengthy case analyses, which are sometimes given to a computer for verification. However, it is much less common to use a computer to actively look for a discharging proof. In this paper, we use a Linear Programming approach to automatically look for a discharging proof. While our system is not entirely autonomous, we manage to make some progress towards Wegner's conjecture for distance-2 coloring of planar graphs, by showing that 12 colors are sufficient to color at distance 2 every planar graph with maximum degree 4.


page 1

page 2

page 3

page 4


2-distance 4-coloring of planar subcubic graphs with girth at least 21

A 2-distance k-coloring of a graph is a proper vertex k-coloring where v...

2-distance (Δ+1)-coloring of sparse graphs using the potential method

A 2-distance k-coloring of a graph is a proper k-coloring of the vertice...

Computer assisted discharging procedure on planar graphs: application to 2-distance coloring

Using computational techniques we provide a framework for proving result...

On interval edge-colorings of planar graphs

An edge-coloring of a graph G with colors 1,…,t is called an interval t-...

The linear arboricity conjecture for 3-degenerate graphs

A k-linear coloring of a graph G is an edge coloring of G with k colors ...

DP-4-coloring of planar graphs with some restrictions on cycles

DP-coloring was introduced by Dvořák and Postle as a generalization of l...

Improved Bounds for Randomly Sampling Colorings via Linear Programming

A well-known conjecture in computer science and statistical physics is t...