Pages that link to "Item:Q1356563"
From MaRDI portal
The following pages link to Covering and coloring polygon-circle graphs (Q1356563):
Displaying 49 items.
- Triangle-free geometric intersection graphs with large chromatic number (Q377499) (← links)
- Classes of graphs with small rank decompositions are \(\chi \)-bounded (Q412260) (← 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)
- Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors (Q505914) (← links)
- On the page number of RNA secondary structures with pseudoknots (Q694703) (← links)
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
- Coloring non-crossing strings (Q727171) (← links)
- On the chromatic number of disjointness graphs of curves (Q777485) (← links)
- On the structure of certain intersection graphs (Q845675) (← links)
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
- Independent sets and chromatic numbers of circle graphs (Q906759) (← links)
- Finding common structured patterns in linear graphs (Q974741) (← links)
- Maximum independent set and maximum clique algorithms for overlap graphs (Q1408815) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- Finding a maximum induced matching in weakly chordal graphs (Q1810638) (← links)
- A triangle-free circle graph with chromatic number 5 (Q1917502) (← links)
- An upper bound on the chromatic number of a circle graph without \(K_4\) (Q1930220) (← links)
- Algorithms for induced biclique optimization problems (Q1944925) (← 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)
- On the chromatic number of some geometric type Kneser graphs (Q2387203) (← links)
- Blocking visibility for points in general position (Q2391198) (← links)
- New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs (Q2404619) (← links)
- Coloring curves that cross a fixed curve (Q2415382) (← links)
- The graphs with maximum induced matching and maximum matching the same size (Q2568473) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs (Q2788740) (← links)
- Coloring a set of touching strings (Q2851465) (← links)
- On the Page Number of Upward Planar Directed Acyclic Graphs (Q3223971) (← links)
- Coloring circle graphs (Q3503503) (← links)
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete (Q3508571) (← links)
- Circle graphs are quadratically χ‐bounded (Q5006380) (← links)
- Hasse diagrams with large chromatic number (Q5006387) (← links)
- Improved bounds for colouring circle graphs (Q5039236) (← links)
- Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)
- On Strict (Outer-)Confluent Graphs (Q5084690) (← links)
- (Q5088986) (← links)
- Outerstring Graphs are $\chi$-Bounded (Q5244121) (← links)
- Islands in Graphs on Surfaces (Q5743553) (← links)
- Disjointness graphs of segments in the space (Q5886095) (← links)
- On circle graphs with girth at least five (Q5900070) (← links)
- Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)
- Edge colorings avoiding patterns (Q6181991) (← links)
- Treewidth, Circle Graphs, and Circular Drawings (Q6195956) (← links)
