scientific article; zbMATH DE number 7771730
From MaRDI portal
Publication:6072045
zbMath1527.05068arXiv2203.10402MaRDI QIDQ6072045
Publication date: 29 November 2023
Full work available at URL: https://arxiv.org/abs/2203.10402
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Sparsity. Graphs, structures, and algorithms
- Characterisations and examples of graph classes with bounded expansion
- Boxicity, poset dimension, and excluded minors
- Colouring graphs with bounded generalized colouring number
- Orderings on graphs and game coloring number
- Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
- Remarks on proper conflict-free colorings of graphs
- Colorings with neighborhood parity condition
- Remarks on odd colorings of graphs
- Graphs with linearly bounded Ramsey numbers
- Grad and classes with bounded expansion. I: Decompositions
- The odd chromatic number of a planar graph is at most 8
- Odd coloring of sparse graphs and planar graphs
- Strongly Sublinear Separators and Polynomial Expansion
- Acyclic and oriented chromatic numbers of graphs
- Radius two trees specify χ‐bounded classes
- Improper colourings inspired by Hadwiger's conjecture
- Sublinear Separators in Intersection Graphs of Convex Shapes
- On the generalised colouring numbers of graphs that exclude a fixed minor
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
This page was built for publication:
