Colouring graphs with bounded generalized colouring number
From MaRDI portal
Recommendations
Cites work
- A simple competitive graph coloring algorithm
- An extremal function for contractions of graphs
- Excluding any graph as a minor allows a low tree-width 2-coloring
- Graphs with linearly bounded Ramsey numbers
- scientific article; zbMATH DE number 3865318 (Why is no real title available?)
- Linear time low tree-width partitions and algorithmic consequences
- Orderings on graphs and game coloring number
- Radius two trees specify χ‐bounded classes
- Tree-depth, subgraph coloring and homomorphism bounds
Cited in
(69)- Colouring games on outerplanar graphs and trees
- Generalization of transitive fraternal augmentations for directed graphs and its applications
- Bounds for mean colour numbers of graphs
- Characterising bounded expansion by neighbourhood complexity
- Chromatic numbers of exact distance graphs
- Notes on graph product structure theory
- Twin-width and generalized coloring numbers
- Improved bounds for weak coloring numbers
- On coloring numbers of graph powers
- Clustering powers of sparse graphs
- Polynomial treedepth bounds in linear colorings
- Uniform orderings for generalized coloring numbers
- On the weak 2-coloring number of planar graphs
- 2-coloring number revisited
- On nowhere dense graphs
- Tree-depth, subgraph coloring and homomorphism bounds
- Kernelization and approximation of distance-r independent sets on nowhere dense graphs
- Bounds on half graph orders in powers of sparse graphs
- Colouring and covering nowhere dense graphs
- Counting homomorphisms to sparse graphs
- Many Facets of Dualities
- Bounded Max-colorings of Graphs
- Bounds on vertex colorings with restrictions on the union of color classes
- Digraphs of bounded width
- Two lower bounds for p-centered colorings
- Adapted game colouring of graphs
- Coloring and covering nowhere dense graphs
- The generalised colouring numbers on classes of bounded expansion
- Colouring edges with many colours in cycles
- Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness
- Sublinear separators in intersection graphs of convex shapes
- Algorithmic properties of sparse digraphs
- Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness
- Improved bounds for centered colorings
- Lossy kernels for connected dominating set on sparse graphs
- A study of the boundary graph classes for colorability problems
- Erdös-Hajnal properties for powers of sparse graphs
- Clustered colouring of graph classes with bounded treedepth or pathwidth
- On the generalised colouring numbers of graphs that exclude a fixed minor
- On low rank-width colorings
- On the generalised colouring numbers of graphs that exclude a fixed minor
- A distributed low tree-depth decomposition algorithm for bounded expansion classes
- Odd colourings, conflict-free colourings and strong colouring numbers
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
- scientific article; zbMATH DE number 7764102 (Why is no real title available?)
- Shallow Minors, Graph Products, and Beyond-Planar Graphs
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
- Graph product structure for non-minor-closed classes
- A color-avoiding approach to subgraph counting in bounded expansion classes
- Dimension is polynomial in height for posets with planar cover graphs
- Bounding generalized coloring numbers of planar graphs using coin models
- Hardness of the generalized coloring numbers
- Discrepancy and sparsity
- Characterisations and examples of graph classes with bounded expansion
- Treelike decompositions for transductions of sparse graphs
- On classes of bounded tree rank, their interpretations, and efficient sparsification
- Cop-width, flip-width and strong colouring numbers
- The r-dynamic chromatic number is bounded in the strong 2-coloring number
- Subchromatic numbers of powers of graphs with excluded minors
- Rank-width and tree-width of \(H\)-minor-free graphs
- First-order transductions of graphs (invited talk)
- Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
- Shallow brambles
- Advances in algorithmic meta theorems (invited paper)
- Results on H-freeness testing in graphs of bounded r-admissibility
- Defective and clustered colouring of graphs with given girth
- Testing C_k-freeness in bounded admissibility graphs
- Rainbow independent sets on dense graph classes
- On low tree-depth decompositions
This page was built for publication: Colouring graphs with bounded generalized colouring number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045038)
