Circle graphs are quadratically χ‐bounded
From MaRDI portal
Publication:5006380
DOI10.1112/blms.12447zbMath1470.05052arXiv1905.11578OpenAlexW2946959590MaRDI QIDQ5006380
Publication date: 13 August 2021
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1905.11578
Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (13)
Disjointness graphs of segments in the space ⋮ Improved bounds for colouring circle graphs ⋮ Ramsey numbers of semi-algebraic and semi-linear hypergraphs ⋮ Quasiplanar graphs, string graphs, and the Erdős-Gallai problem ⋮ Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded ⋮ Ramsey properties of semilinear graphs ⋮ Coloring triangle-free L-graphs with \(O (\log \log n)\) colors ⋮ Treewidth, Circle Graphs, and Circular Drawings ⋮ The combinatorics of a tree-like functional equation for connected chord diagrams ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ On the upward book thickness problem: combinatorial and complexity results ⋮ Outerstring Graphs are $\chi$-Bounded ⋮ Hasse diagrams with large chromatic number
Cites Work
- Unnamed Item
- Unnamed Item
- Classes of graphs with small rank decompositions are \(\chi \)-bounded
- On-line approach to off-line coloring problems on graphs with geometric representations
- On the chromatic number of multiple interval graphs and overlap graphs
- A Turán-type theorem on chords of a convex polygon
- Covering and coloring polygon-circle graphs
- Algorithmic graph theory and perfect graphs
- A triangle-free circle graph with chromatic number 5
- Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded
- A survey of χ‐boundedness
- Graphs of bounded cliquewidth are polynomially $χ$-bounded
This page was built for publication: Circle graphs are quadratically χ‐bounded
