Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777079 | Electronic Notes in Discrete Mathematics | 2017 | 7 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hojin Choi, O-joung Kwon, Sang-il Oum, Paul Wollan,