Substitution and Χ-boundedness

Authors:
Maria Chudnovsky;Irena Penev;Alex Scott;Nicolas Trotignon
Affiliations:
Columbia University, New York, NY 10027, USA;Park Tudor School, Indianapolis, IN 46240, USA;Mathematical Institute, University of Oxford, 24-29 St Giles, Oxford OX1 3LB, UK;CNRS, LIP, ENS Lyon, Université de Lyon, INRIA, France
Venue:
Journal of Combinatorial Theory Series B
Year:
2013

Citing 8
Cited 0

Radius two trees specify &khgr;-bounded classes

Journal of Graph Theory
Induced trees in graphs of large chromatic number

Journal of Graph Theory
Induced cycles and chromatic number

Journal of Combinatorial Theory Series B
Radius Three Trees in Graphs with Large Chromatic Number

SIAM Journal on Discrete Mathematics
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins

Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Even pairs in Berge graphs

Journal of Combinatorial Theory Series B
The Ramsey number R(3, t) has order of magnitude t2/log t

Random Structures & Algorithms
Graphs of separability at most 2

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

A class G of graphs is said to be @g-bounded if there is a function f:N-R such that for all G@?G and all induced subgraphs H of G, @g(H)=