Pages that link to "Item:Q1356563"
From MaRDI portal
The following pages link to Covering and coloring polygon-circle graphs (Q1356563):
Displayed 21 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 the page number of RNA secondary structures with pseudoknots (Q694703) (← links)
- On the structure of certain intersection graphs (Q845675) (← 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)
- On the chromatic number of some geometric type Kneser graphs (Q2387203) (← links)
- Blocking visibility for points in general position (Q2391198) (← links)
- The graphs with maximum induced matching and maximum matching the same size (Q2568473) (← links)
- Independent packings in structured graphs (Q2583122) (← 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)
- Islands in Graphs on Surfaces (Q5743553) (← links)
- On circle graphs with girth at least five (Q5900070) (← links)
