DeepAI AI Chat
Log In Sign Up

Graph multicoloring reduction methods and application to McDiarmid-Reed's Conjecture

by   Jean-Christophe Godin, et al.

A (a,b)-coloring of a graph G associates to each vertex a set of b colors from a set of a colors in such a way that the color-sets of adjacent vertices are disjoints. We define general reduction tools for (a,b)-coloring of graphs for 2< a/b< 3. In particular, we prove necessary and sufficient conditions for the existence of a (a,b)-coloring of a path with prescribed color-sets on its end-vertices. Other more complex (a,b)-colorability reductions are presented. The utility of these tools is exemplified on finite triangle-free induced subgraphs of the triangular lattice. Computations on millions of such graphs generated randomly show that our tools allow to find (in linear time) a (9,4)-coloring for each of them. Although there remain few graphs for which our tools are not sufficient for finding a (9,4)-coloring, we believe that pursuing our method can lead to a solution of the conjecture of McDiarmid-Reed.


page 1

page 2

page 3

page 4


2-distance list (Δ+2)-coloring of planar graphs with girth at least 10

Given a graph G and a list assignment L(v) for each vertex of v of G. A ...

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

Coloring Drawings of Graphs

We consider face-colorings of drawings of graphs in the plane. Given a m...

Parameter Estimation for Undirected Graphical Models with Hard Constraints

The hardcore model on a graph G with parameter λ>0 is a probability meas...

Polyhedral study of the Convex Recoloring problem

A coloring of the vertices of a connected graph is convex if each color ...

On Regular Set Systems Containing Regular Subsystems

Let X,Y be finite sets, r,s,h, λ∈ℕ with s≥ r, X⊊ Y. By λXh we mean the c...

A proof of the Total Coloring Conjecture

A total coloring of a graph G is a map f:V(G) ∪ E(G) →𝒦, where 𝒦 is a se...