On forbidden subdivision characterizations of graph classes

Authors:
Zdenk Dvořák
Affiliations:
Charles University, Faculty of Mathematics and Physics, Institute for Theoretical Computer Science (ITI),11Supported as project 1M0545 by the Czech Ministry of Education. Malostranské ná ...
Venue:
European Journal of Combinatorics
Year:
2008

Citing 6
Cited 5

Graphs with linearly bounded Ramsey numbers

Journal of Combinatorial Theory Series B
Planar graph coloring with an uncooperative partner

Journal of Graph Theory
A bound for the game chromatic number of graphs

Discrete Mathematics
Grad and classes with bounded expansion I. Decompositions

European Journal of Combinatorics
Grad and classes with bounded expansion II. Algorithmic aspects

European Journal of Combinatorics
Grad and classes with bounded expansion III. Restricted graph homomorphism dualities

European Journal of Combinatorics

Rank-width and tree-width of H-minor-free graphs

European Journal of Combinatorics
On nowhere dense graphs

European Journal of Combinatorics
Characterisations and examples of graph classes with bounded expansion

European Journal of Combinatorics
Constant-factor approximation of the domination number in sparse graphs

European Journal of Combinatorics
Distance-two coloring of sparse graphs

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide a characterization of several graph parameters (the acyclic chromatic number, the arrangeability, and a sequence of parameters related to the expansion of a graph) in terms of forbidden subdivisions.