Pages that link to "Item:Q3508571"
From MaRDI portal
The following pages link to Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete (Q3508571):
Displaying 13 items.
- On-line approach to off-line coloring problems on graphs with geometric representations (Q722314) (← links)
- Semi-transitive orientations and word-representable graphs (Q908303) (← links)
- Cops and robbers on intersection graphs (Q1645059) (← links)
- Polygon-circle and word-representable graphs (Q1739939) (← links)
- Algorithms for induced biclique optimization problems (Q1944925) (← links)
- Succinct navigational oracles for families of intersection graphs on a circle (Q2079878) (← links)
- Distributed interactive proofs for the recognition of some geometric intersection graph classes (Q2097349) (← links)
- MINIMUM WEIGHT FEEDBACK VERTEX SETS IN CIRCLE n-GON GRAPHS AND CIRCLE TRAPEZOID GRAPHS (Q2890989) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Alternation Graphs (Q3104776) (← links)
- Algorithms on Subtree Filament Graphs (Q3655136) (← links)
- Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)
- On 3-degree 4-chordal graphs (Q6174132) (← links)
