On forbidden subdivision characterizations of graph classes

DOI10.1016/j.ejc.2007.05.008zbMath1151.05038OpenAlexW2118815975MaRDI QIDQ925035

Zdeněk Dvořák

Publication date: 29 May 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.05.008

zbMATH Keywords

acyclic chromatic numbergame chromatic numbergraph classes\(t\)-subdivisionacyclic proper coloringarrangeabilitygreatest reduced average density

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (16)

Induced and weak induced arboricities ⋮ Properties of Large 2-Crossing-Critical Graphs ⋮ 1-subdivisions, the fractional chromatic number and the Hall ratio ⋮ Sublinear separators, fragility and subexponential expansion ⋮ A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth ⋮ Hat Guessing Numbers of Strongly Degenerate Graphs ⋮ On nowhere dense graphs ⋮ Distance-two coloring of sparse graphs ⋮ Colouring edges with many colours in cycles ⋮ Characterisations and examples of graph classes with bounded expansion ⋮ First order properties on nowhere dense structures ⋮ Rank-width and tree-width of \(H\)-minor-free graphs ⋮ Generalization of transitive fraternal augmentations for directed graphs and its applications ⋮ From \(\chi\)- to \(\chi_p\)-bounded classes ⋮ Equitable partition of graphs into induced forests ⋮ Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision

Cites Work

• Fraternal augmentations, arrangeability and linear Ramsey numbers
• On acyclic colorings of planar graphs
• A bound for the game chromatic number of graphs
• Orderings on graphs and game coloring number
• Coloring with no 2-colored \(P_4\)'s
• Graphs with linearly bounded Ramsey numbers
• Grad and classes with bounded expansion. I: Decompositions
• Grad and classes with bounded expansion. II: Algorithmic aspects
• Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities
• On the Chromatic Number of Subgraphs of a Given Graph
• Radius two trees specify χ‐bounded classes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On forbidden subdivision characterizations of graph classes