Investigates extendable colorings in rooted minor-free graphs, suggesting broader applications in graph theory.
DeVos and Seymour 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.
No takes yet. Share an insight, caveat, or question.
Dvořák et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: