Pages that link to "Item:Q1408815"
From MaRDI portal
The following pages link to Maximum independent set and maximum clique algorithms for overlap graphs (Q1408815):
Displaying 10 items.
- Minimum vertex cover in rectangle graphs (Q551504) (← links)
- How to guard a graph? (Q652526) (← links)
- On simultaneous planar graph embeddings (Q857060) (← links)
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
- Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket (Q1704581) (← links)
- Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← links)
- Subtree filament graphs are subtree overlap graphs (Q2380028) (← links)
- New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs (Q2404619) (← links)
- 3D-interval-filament graphs (Q2462403) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
