Twin-width and generalized coloring numbers
From MaRDI portal
Publication:2065919
DOI10.1016/j.disc.2021.112746zbMath1480.05055arXiv2104.09360OpenAlexW4206965591MaRDI QIDQ2065919
Yiting Jiang, Jakub Gajarský, Jan Dreier, Jean-Florent Raymond, Patrice Ossona de Mendez
Publication date: 13 January 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.09360
Related Items (3)
Bounds for the Twin-Width of Graphs ⋮ Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded ⋮ Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
Cites Work
- Sparsity. Graphs, structures, and algorithms
- Colouring graphs with bounded generalized colouring number
- Complement reducible graphs
- Orderings on graphs and game coloring number
- Constant-factor approximation of the domination number in sparse graphs
- Strongly Sublinear Separators and Polynomial Expansion
- Coloring and Covering Nowhere Dense Graphs
- Finding small patterns in permutations in linear time
This page was built for publication: Twin-width and generalized coloring numbers
