Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded
From MaRDI portal
Publication:6142355
DOI10.1007/s00454-023-00592-zzbMath1529.05113arXiv2108.05611MaRDI QIDQ6142355
Rose McCarty, Bartosz Walczak, Tomasz Krawczyk, James E. Davies
Publication date: 21 December 2023
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.05611
Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Maximum weight independent sets and cliques in intersection graphs of filaments
- Max point-tolerance graphs
- Triangle-free geometric intersection graphs with large chromatic number
- Coloring intersection graphs of arc-connected sets in the plane
- Coloring intersection graphs of \(x\)-monotone curves in the plane
- On-line approach to off-line coloring problems on graphs with geometric representations
- On the chromatic number of multiple interval graphs and overlap graphs
- The max clique problem in classes of string-graphs
- A Turán-type theorem on chords of a convex polygon
- Covering and coloring polygon-circle graphs
- Algorithmic graph theory and perfect graphs
- On bounding the chromatic number of L-graphs
- Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
- On grounded \(\llcorner\)-graphs and their relatives
- Coloring and Maximum Independent Set of Rectangles
- On a Coloring Problem.
- Intersection Graphs of Rays and Grounded Segments
- Circle graphs are quadratically χ‐bounded
- Improved bounds for colouring circle graphs
- A survey of χ‐boundedness
- Outerstring Graphs are $\chi$-Bounded
- Applications of a New Separator Theorem for String Graphs
- Refining the hierarchies of classes of geometric intersection graphs
- Colouring arcwise connected sets in the plane. I
- Coloring triangle-free L-graphs with \(O (\log \log n)\) colors
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded
