Article ID Journal Published Year Pages File Type
5777079 Electronic Notes in Discrete Mathematics 2017 7 Pages PDF
Abstract
A class of graphs is χ-bounded if there exists a function f:N→N such that for every graph G in the class and an induced subgraph H of G, if H has no clique of size q+1, then the chromatic number of H is less than or equal to f(q). We denote by Wn the wheel graph on n+1 vertices. We show that the class of graphs having no vertex-minor isomorphic to Wn is χ-bounded. This generalizes several previous results; χ-boundedness for circle graphs, for graphs having no W5 vertex-minors, and for graphs having no fan vertex-minors.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, , , ,