The polynomial method for list-colouring extendability of outerplanar graphs

12/16/2019

∙

We restate theorems of Hutchinson on list-colouring extendability for outerplanar graphs in terms of non-vanishing monomials in a graph polynomial, this way obtaining Alon-Tarsi equivalent for her work. This allows to simplify the proofs as well as obtain more general results.

READ FULL TEXT

The polynomial method for list-colouring extendability of outerplanar graphs

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

Solving Graph Isomorphism Problem for a Special case

List k-Colouring P_t-Free Graphs with No Induced 1-Subdivision of K_1,s: a Mim-width Perspective

Sparsification Lower Bounds for List H-Coloring

On the Chromatic Polynomial and Counting DP-Colorings

The Lexicographic Method for the Threshold Cover Problem

Smooth approximations and CSPs over finitely bounded homogeneous structures

The polynomial method for list-colouring extendability of outerplanar graphs

Related Research

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

Solving Graph Isomorphism Problem for a Special case

List k-Colouring P_t-Free Graphs with No Induced 1-Subdivision of K_1,s: a Mim-width Perspective

Sparsification Lower Bounds for List H-Coloring

On the Chromatic Polynomial and Counting DP-Colorings

The Lexicographic Method for the Threshold Cover Problem

Smooth approximations and CSPs over finitely bounded homogeneous structures