On forbidden subdivision characterizations of graph classes
DOI10.1016/J.EJC.2007.05.008zbMATH Open1151.05038OpenAlexW2118815975MaRDI QIDQ925035FDOQ925035
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
Recommendations
graph classesacyclic chromatic numbergame chromatic number\(t\)-subdivisionacyclic proper coloringarrangeabilitygreatest reduced average density
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- On acyclic colorings of planar graphs
- 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
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
- A bound for the game chromatic number of graphs
- Coloring with no 2-colored \(P_4\)'s
- Title not available (Why is that?)
- On the Chromatic Number of Subgraphs of a Given Graph
- Radius two trees specify χ‐bounded classes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graphs with linearly bounded Ramsey numbers
- Orderings on graphs and game coloring number
- Fraternal augmentations, arrangeability and linear Ramsey numbers
Cited In (24)
- From \(\chi\)- to \(\chi_p\)-bounded classes
- On nowhere dense graphs
- Characterisations and examples of graph classes with bounded expansion
- 1-subdivisions, the fractional chromatic number and the Hall ratio
- Title not available (Why is that?)
- Generalization of transitive fraternal augmentations for directed graphs and its applications
- Induced and weak induced arboricities
- A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth
- Distance-two coloring of sparse graphs
- Rank-width and tree-width of \(H\)-minor-free graphs
- Colouring edges with many colours in cycles
- Forbidden-minor characterization for the class of graphic element splitting matroids
- On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
- Equitable partition of graphs into induced forests
- First order properties on nowhere dense structures
- Sublinear separators, fragility and subexponential expansion
- A forbidden subgraph characterization of some graph classes using betweenness axioms
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
- Hat Guessing Numbers of Strongly Degenerate Graphs
- Minimal separators in graph classes defined by small forbidden induced subgraphs
- Properties of Large 2-Crossing-Critical Graphs
- Title not available (Why is that?)
- Enumerations, forbidden subgraph characterizations, and the split-decomposition
- Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision
This page was built for publication: On forbidden subdivision characterizations of graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925035)
