The following pages link to (Q4027165):
Displayed 8 items.
- Covering and coloring polygon-circle graphs (Q1356563) (← links)
- Maximum independent set and maximum clique algorithms for overlap graphs (Q1408815) (← links)
- Polygon-circle and word-representable graphs (Q1739939) (← links)
- On the representation number of a crown graph (Q1752592) (← links)
- Succinct navigational oracles for families of intersection graphs on a circle (Q2079878) (← links)
- Word-representability of Toeplitz graphs (Q2334044) (← links)
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete (Q3508571) (← links)
- Word-Representable Graphs: a Survey (Q4558287) (← links)