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 of 3-colorings of a set of vertices, there exists a plane graph with vertices of incident with the outer face such that a 3-coloring of extends to a 3-coloring of if and only if it belongs to . We prove a generalization of this claim for -colorings of -rooted--minor-free -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