AI Chat AI Image Generator AI Video Text to Speech

Flexibility of planar graphs of girth at least six

02/11/2019

∙

by Zdeněk Dvořák, et al.

∙

∙

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 L-coloring respecting at least a constant fraction of the preferences.

Zdeněk Dvořák
23 publications
Tomáš Masařík
39 publications
Jan Musílek
2 publications
Ondřej Pangrác
2 publications

page 1

page 2

page 3

page 4

research

∙ 02/08/2019

Flexibility of triangle-free planar graphs

Let G be a planar graph with a list assignment L. Suppose a preferred co...

0 Zdeněk Dvořák, et al. ∙

research

∙ 03/04/2019

Flexibility of planar graphs without 4-cycles

Proper graph coloring assigns different colors to adjacent vertices of t...

0 Tomáš Masařík, et al. ∙

research

∙ 09/16/2020

On Weak Flexibility in Planar Graphs

Recently, Dvořák, Norin, and Postle introduced flexibility as an extensi...

0 Bernard Lidický, et al. ∙

research

∙ 04/23/2020

Flexibility of Planar Graphs – Sharpening the Tools to Get Lists of Size Four

A graph where each vertex v has a list L(v) of available colors is L-col...

0 Ilkyoo Choi, et al. ∙

research

∙ 09/13/2022

List recoloring of planar graphs

A list assignment L of a graph G is a function that assigns to every ver...

0 L. Sunil Chandran, et al. ∙

research

∙ 06/29/2020

Flexible List Colorings in Graphs with Special Degeneracy Conditions

For a given ε > 0, we say that a graph G is ϵ-flexibly k-choosable if th...

0 Peter Bradshaw, et al. ∙

research

∙ 01/16/2023

An efficient implementation and a strengthening of Alon-Tarsi list coloring method

As one of the first applications of the polynomial method in combinatori...

0 Zdeněk Dvořák, et al. ∙