Abstract: We prove that the chromatic number of a circle graph with clique number is at most .
Cites work
- A survey of -boundedness
- A triangle-free circle graph with chromatic number 5
- A Turán-type theorem on chords of a convex polygon
- Algorithmic graph theory and perfect graphs
- Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded
- Classes of graphs with small rank decompositions are \(\chi \)-bounded
- Covering and coloring polygon-circle graphs
- Graphs of bounded cliquewidth are polynomially -bounded
- scientific article; zbMATH DE number 4108789 (Why is no real title available?)
- scientific article; zbMATH DE number 2145236 (Why is no real title available?)
- On the chromatic number of multiple interval graphs and overlap graphs
- On-line approach to off-line coloring problems on graphs with geometric representations
Cited in
(27)- Graph theory. Abstracts from the workshop held January 2--8, 2022
- Hasse diagrams with large chromatic number
- Improved bounds for colouring circle graphs
- Outerstring graphs are -bounded
- Disjointness graphs of segments in the space
- On the upward book thickness problem: combinatorial and complexity results
- 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
- Vertex-minors of graphs: a survey
- A (1.5+)-approximation algorithm for weighted connectivity augmentation
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
- Treewidth, circle graphs and circular drawings
- Reuniting -boundedness with polynomial -boundedness
- New formulation for coloring circle graphs
- Isometric path complexity of graphs
- A survey of degree-boundedness
- Vertex-minor-closed classes are -bounded
- Semi-algebraic and semi-linear Ramsey numbers (extended abstract)
- Chromatic number of intersection graphs of segments with two slopes (extended abstract)
- Polynomial Gyárfás-Sumner conjecture for graphs of bounded boxicity
- Forbidden patterns in mixed linear layouts
- Sublinear hitting sets for some geometric graphs
This page was built for publication: Circle graphs are quadratically χ‐bounded
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5006380)
