
Flexibility of trianglefree planar graphs
Let G be a planar graph with a list assignment L. Suppose a preferred co...
02/08/2019 ∙ by Zdeněk Dvořák, et al. ∙ 0 ∙ shareread it

Flexibility of planar graphs without 4cycles
Proper graph coloring assigns different colors to adjacent vertices of t...
03/04/2019 ∙ by Tomáš Masařík, et al. ∙ 0 ∙ shareread it

Planar Ramsey graphs
We say that a graph H is planar unavoidable if there is a planar graph G...
12/03/2018 ∙ by Maria Axenovich, et al. ∙ 0 ∙ shareread it

List edge coloring of outer1planar graphs
A graph is outer1planar if it can be drawn in the plane so that all ve...
02/12/2019 ∙ by Xin Zhang, et al. ∙ 0 ∙ shareread it

A Branch and Price Algorithm for List Coloring Problem
Coloring problems in graphs have been used to model a wide range of real...
11/30/2018 ∙ by Mauro Lucci, et al. ∙ 0 ∙ shareread it

Colored Pointset Embeddings of Acyclic Graphs
We show that any planar drawing of a forest of three stars whose vertice...
08/30/2017 ∙ by Emilio Di Giacomo, et al. ∙ 0 ∙ shareread it

Sampling Humans for Optimizing Preferences in Coloring Artwork
Many circumstances of practical importance have performance or success m...
06/10/2019 ∙ by Michael McCourt, et al. ∙ 0 ∙ shareread it
Flexibility of planar graphs of girth at least six
Let G be a planar graph with a list assignment L. Suppose a preferred color is given for some of the vertices. We prove that if G has girth at least six and all lists have size at least three, then there exists an Lcoloring respecting at least a constant fraction of the preferences.
READ FULL TEXT