On low rank-width colorings
From MaRDI portal
(Redirected from Publication:5918207)
On low rank-width colorings (scientific article; zbMATH DE number 7138249)
On low rank-width colorings (scientific article; zbMATH DE number 7138249)
Recommendations
- On low rank-width colorings
- The rank-width of edge-coloured graphs
- On the chromatic numbers of low-dimensional spaces
- Graph coloring and semidefinite rank
- Tight lower bounds for the complexity of multicoloring
- Tight lower bounds for the complexity of multicoloring
- scientific article; zbMATH DE number 2076918
- Coloring hypergraphs of low connectivity
- Finer tight bounds for coloring on clique-width
- Finer tight bounds for coloring on clique-width
Cites work
- \(k\)-NLC graphs and polynomial algorithms
- Approximating clique-width and branch-width
- Boolean-width of graphs
- Branch-depth: generalizing tree-depth of graphs
- Caterpillars in Erdős-Hajnal
- Classes of graphs with small rank decompositions are \(\chi \)-bounded
- Clique-width for 4-vertex forbidden subgraphs
- Colouring graphs with bounded generalized colouring number
- Compact labelings for efficient first-order model-checking
- Erdos-Hajnal conjecture for graphs with bounded VC-dimension
- Excluding any graph as a minor allows a low tree-width 2-coloring
- First-order interpretations of bounded expansion classes
- Grad and classes with bounded expansion. I: Decompositions
- Graph minors. XVI: Excluding a non-planar graph
- Handle-rewriting hypergraph grammars
- scientific article; zbMATH DE number 5720940 (Why is no real title available?)
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- scientific article; zbMATH DE number 1142315 (Why is no real title available?)
- scientific article; zbMATH DE number 1414315 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- Learnability and definability in trees and similar structures
- Linear time solvable optimization problems on graphs of bounded clique-width
- Map graphs
- Methods for algorithmic meta theorems
- Minimal classes of graphs of unbounded clique-width
- On low rank-width colorings
- On nowhere dense graphs
- On the order of countable graphs
- Optimal node ranking of tree in linear time
- Orderings on graphs and game coloring number
- Ramsey-type theorems
- Rankings of Graphs
- Rank‐width is less than or equal to branch‐width
- Testing first-order properties for subclasses of sparse graphs
- The Erdős-Hajnal conjecture for long holes and antiholes
- The Erdős-Hajnal conjecture. A survey
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The NLC-width and clique-width for powers of graphs of bounded tree-width
- Tree-depth, subgraph coloring and homomorphism bounds
- Vertex-minors and the Erdős-Hajnal conjecture
- When trees grow low: shrubs and fast \(\mathrm{MSO}_{1}\)
Cited in
(11)- Clustering powers of sparse graphs
- Regular partitions of gentle graphs
- Polynomial treedepth bounds in linear colorings
- Classes of graphs with low complexity: the case of classes with bounded linear rankwidth
- The rank-width of edge-coloured graphs
- Erdös-Hajnal properties for powers of sparse graphs
- On low rank-width colorings
- A class of graphs with large rankwidth
- Bounding generalized coloring numbers of planar graphs using coin models
- Turbocharging heuristics for weak coloring numbers
- Rainbow independent sets on dense graph classes
This page was built for publication: On low rank-width colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918207)
