Chi-boundedness of graph classes excluding wheel vertex-minors

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 67
  • Download : 0
A class of graphs is X-bounded if there exists a function f : N -> Nsuch 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 W-n the wheel graph on n +1 vertices. We show that the class of graphs having no vertex-minor isomorphic to W-n is chi-bounded. This generalizes several previous results; chi-boundedness for circle graphs, for graphs having no W-5 vertex-minors, and for graphs having no fan vertex-minors. (C) 2018 Elsevier Inc. All rights reserved.
Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
Issue Date
2019-03
Language
English
Article Type
Article
Citation

JOURNAL OF COMBINATORIAL THEORY SERIES B, v.135, pp.319 - 348

ISSN
0095-8956
DOI
10.1016/j.jctb.2018.08.009
URI
http://hdl.handle.net/10203/250340
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0