On forbidden subdivision characterizations of graph classes
From MaRDI portal
(Redirected from Publication:925035)
Recommendations
Cites work
- scientific article; zbMATH DE number 3540832 (Why is no real title available?)
- scientific article; zbMATH DE number 2159660 (Why is no real title available?)
- scientific article; zbMATH DE number 970807 (Why is no real title available?)
- scientific article; zbMATH DE number 2209736 (Why is no real title available?)
- A bound for the game chromatic number of graphs
- Coloring with no 2-colored \(P_4\)'s
- Fraternal augmentations, arrangeability and linear 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
- Graphs with linearly bounded Ramsey numbers
- On acyclic colorings of planar graphs
- On the Chromatic Number of Subgraphs of a Given Graph
- Orderings on graphs and game coloring number
- Radius two trees specify χ‐bounded classes
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(28)- 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
- scientific article; zbMATH DE number 2159660 (Why is no real title available?)
- Generalization of transitive fraternal augmentations for directed graphs and its applications
- Induced and weak induced arboricities
- Properties of large 2-crossing-critical graphs
- Characterization of forbidden subgraphs for bounded star chromatic number
- Distance-two coloring of sparse graphs
- Graph sharing game and the structure of weighted graphs with a forbidden subdivision
- Acyclic colorings of graphs with obstructions
- 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
- Equitable partition of graphs into induced forests
- On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
- Sublinear separators, fragility and subexponential expansion
- A forbidden subgraph characterization of some graph classes using betweenness axioms
- First order properties on nowhere dense structures
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
- A unified approach to structural limits and limits of graphs with bounded tree-depth
- Oriented colouring graphs of bounded degree and degeneracy
- Hat Guessing Numbers of Strongly Degenerate Graphs
- Minimal separators in graph classes defined by small forbidden induced subgraphs
- scientific article; zbMATH DE number 7731182 (Why is no real title available?)
- Enumerations, forbidden subgraph characterizations, and the split-decomposition
- Injective edge colorings of degenerate graphs and the oriented chromatic number
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)
