On the chromatic number of multiple interval graphs and overlap graphs
From MaRDI portal
(Redirected from Publication:1061131)
Recommendations
- On the chromatic number of the -overlap graphs
- On the interval chromatic number of proper interval graphs
- On the chromatic number of order-interval hypergraphs
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
- Interval colorings of edges of a multigraph
- The interleaved multichromatic number of a graph
- The overlap chromatic numbers of wheel graphs
- scientific article; zbMATH DE number 4057534
- scientific article; zbMATH DE number 1146234
- OVERLAP COLOURINGS AND HOMOMORPHISMS OF GRAPHS
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3307331 (Why is no real title available?)
- scientific article; zbMATH DE number 3332242 (Why is no real title available?)
- A Note on the Equation n2+n+1=pr
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- Coloring a Family of Circular Arcs
- On a Coloring Problem.
- On double and multiple interval graphs
- The Complexity of Coloring Circular Arcs and Chords
Cited in
(54)- Coloring translates and homothets of a convex body
- Triangle-free geometric intersection graphs with large chromatic number
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
- Covering and coloring polygon-circle graphs
- Towards a comprehensive theory of conflict-tolerance graphs
- Vertex-minor-closed classes are -bounded
- Coloring intersection graphs of arc-connected sets in the plane
- Coloring triangle-free L-graphs with \(O (\log \log n)\) colors
- Graph theory. Abstracts from the workshop held January 2--8, 2022
- Quasi-planar Graphs
- OVERLAP COLOURINGS AND HOMOMORPHISMS OF GRAPHS
- Circle graphs are quadratically χ‐bounded
- A Turán-type theorem on chords of a convex polygon
- Chromatic number of intersection graphs of segments with two slopes (extended abstract)
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded
- On-line approach to off-line coloring problems on graphs with geometric representations
- Conflict-free coloring of string graphs
- Ramsey properties of semilinear graphs
- A Sublinear Bound on the Page Number of Upward Planar Graphs
- Hasse diagrams with large chromatic number
- Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
- Coloring curves that cross a fixed curve
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes
- Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis
- Colouring polygon visibility graphs and their generalizations
- scientific article; zbMATH DE number 7559254 (Why is no real title available?)
- On fixed-order book thickness parameterized by the pathwidth of the vertex ordering
- Quasi-planar graphs have a linear number of edges
- Interval graphs and related topics
- A triangle-free circle graph with chromatic number 5
- Treewidth, Circle Graphs, and Circular Drawings
- Treewidth, circle graphs and circular drawings
- Directed acyclic outerplanar graphs have constant stack number
- Coloring lines and Delaunay graphs with respect to boxes
- Improved bounds for colouring circle graphs
- On the chromatic number of disjointness graphs of curves
- On the unit interval number of a graph
- Disjointness graphs of segments in the space
- Quasiplanar graphs, string graphs, and the Erdős-Gallai problem
- Vertex-minors of graphs: a survey
- A \((1.5+\varepsilon)\)-approximation algorithm for weighted connectivity augmentation
- On bounding the chromatic number of L-graphs
- A survey of degree-boundedness
- Outerstring graphs are \(\chi \)-bounded
- A note on fractional coloring and the integrality gap of LP for maximum weight independent set
- Coloring intersection graphs of \(x\)-monotone curves in the plane
- On the interval chromatic number of proper interval graphs
- Coloring circle graphs
- The overlap chromatic numbers of wheel graphs
- Excluding a clique or a biclique in graphs of bounded induced matching treewidth
- Coloring Hasse diagrams and disjointness graphs of curves
- Coloring polygon visibility graphs and their generalizations
- Covering and coloring problems for relatives of intervals
- Fractional covers and matchings in families of weighted \(d\)-intervals
This page was built for publication: On the chromatic number of multiple interval graphs and overlap graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1061131)
