On low rank-width colorings
From MaRDI portal
Publication:5918207
DOI10.1016/j.ejc.2019.103002zbMath1428.05110OpenAlexW2967584293WikidataQ127374855 ScholiaQ127374855MaRDI QIDQ5918207
Michał Pilipczuk, Sebastian Siebertz, O-joung Kwon
Publication date: 28 November 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2019.103002
Related Items (6)
Rainbow independent sets on dense graph classes ⋮ A class of graphs with large rankwidth ⋮ Bounding generalized coloring numbers of planar graphs using coin models ⋮ Clustering powers of sparse graphs ⋮ Regular partitions of gentle graphs ⋮ Erdös--Hajnal Properties for Powers of Sparse Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classes of graphs with small rank decompositions are \(\chi \)-bounded
- Compact labelings for efficient first-order model-checking
- Minimal classes of graphs of unbounded clique-width
- Learnability and definability in trees and similar structures
- Boolean-width of graphs
- Ramsey-type theorems
- The NLC-width and clique-width for powers of graphs of bounded tree-width
- Colouring graphs with bounded generalized colouring number
- \(k\)-NLC graphs and polynomial algorithms
- On the order of countable graphs
- Graph minors. XVI: Excluding a non-planar graph
- Vertex-minors and the Erdős-Hajnal conjecture
- Optimal node ranking of tree in linear time
- Orderings on graphs and game coloring number
- Excluding any graph as a minor allows a low tree-width 2-coloring
- Linear time solvable optimization problems on graphs of bounded clique-width
- Branch-depth: generalizing tree-depth of graphs
- Handle-rewriting hypergraph grammars
- Caterpillars in Erdős-Hajnal
- Grad and classes with bounded expansion. I: Decompositions
- On nowhere dense graphs
- Clique-width for 4-vertex forbidden subgraphs
- Tree-depth, subgraph coloring and homomorphism bounds
- Approximating clique-width and branch-width
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- The Erdös--Hajnal Conjecture for Long Holes and Antiholes
- The Erdös-Hajnal Conjecture-A Survey
- When Trees Grow Low: Shrubs and Fast MSO1
- Map graphs
- Rankings of Graphs
- Erdos-Hajnal conjecture for graphs with bounded VC-dimension
- Deciding First-Order Properties of Nowhere Dense Graphs
- Testing first-order properties for subclasses of sparse graphs
- Rank‐width is less than or equal to branch‐width
- On low rank-width colorings
This page was built for publication: On low rank-width colorings
