English

A note on extendable sets of colorings and rooted minors

Combinatorics 2025-04-11 v1

Abstract

DeVos and Seymour (2003) proved that for every set CC of 3-colorings of a set XX of vertices, there exists a plane graph GG with vertices of XX incident with the outer face such that a 3-coloring of XX extends to a 3-coloring of GG if and only if it belongs to CC. We prove a generalization of this claim for kk-colorings of XX-rooted-Kk+1K_{k+1}-minor-free Kk+2K_{k+2}-minor-free graphs.

Keywords

Cite

@article{arxiv.2504.07764,
  title  = {A note on extendable sets of colorings and rooted minors},
  author = {Zdeněk Dvořák and Jan M. Swart},
  journal= {arXiv preprint arXiv:2504.07764},
  year   = {2025}
}

Comments

8 pages, 2, figures