Pages that link to "Item:Q1061131"
From MaRDI portal
The following pages link to On the chromatic number of multiple interval graphs and overlap graphs (Q1061131):
Displaying 37 items.
- Triangle-free geometric intersection graphs with large chromatic number (Q377499) (← links)
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes (Q463287) (← links)
- Coloring intersection graphs of arc-connected sets in the plane (Q464743) (← links)
- Coloring intersection graphs of \(x\)-monotone curves in the plane (Q485004) (← links)
- A note on fractional coloring and the integrality gap of LP for maximum weight independent set (Q510956) (← links)
- Fractional covers and matchings in families of weighted \(d\)-intervals (Q681591) (← links)
- Coloring translates and homothets of a convex body (Q695002) (← links)
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Covering and coloring problems for relatives of intervals (Q1061132) (← links)
- On the unit interval number of a graph (Q1120600) (← links)
- A Turán-type theorem on chords of a convex polygon (Q1204472) (← links)
- Covering and coloring polygon-circle graphs (Q1356563) (← links)
- Quasi-planar graphs have a linear number of edges (Q1375051) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- A triangle-free circle graph with chromatic number 5 (Q1917502) (← links)
- On bounding the chromatic number of L-graphs (Q1918550) (← links)
- Conflict-free coloring of string graphs (Q2022631) (← links)
- On fixed-order book thickness parameterized by the pathwidth of the vertex ordering (Q2039665) (← links)
- Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis (Q2110740) (← links)
- Coloring Hasse diagrams and disjointness graphs of curves (Q2206854) (← links)
- Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors (Q2256590) (← links)
- Coloring curves that cross a fixed curve (Q2415382) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Circle graphs are quadratically χ‐bounded (Q5006380) (← links)
- Hasse diagrams with large chromatic number (Q5006387) (← links)
- Improved bounds for colouring circle graphs (Q5039236) (← links)
- (Q5088986) (← links)
- Coloring polygon visibility graphs and their generalizations (Q6038590) (← links)
- A Sublinear Bound on the Page Number of Upward Planar Graphs (Q6057803) (← links)
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)
- Ramsey properties of semilinear graphs (Q6161733) (← links)
- Coloring triangle-free L-graphs with \(O (\log \log n)\) colors (Q6181998) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)
- Coloring lines and Delaunay graphs with respect to boxes (Q6201036) (← links)
- Vertex-minors of graphs: a survey (Q6495258) (← links)
