Cliques, covers and domination in graphs
Clique, independent set, vertex cover, domination variants, feedback vertex and arc sets, odd cycle transversal, bicliques, densest subgraph, induced matching and minimum fill-in.
- Balanced biclique
- Biclique edge cover
- Clique, independent set and vertex cover
- Connected dominating set
- Densest k-subgraph
- Dominating set
- Edge dominating set
- Efficient domination
- Feedback arc set
- Feedback vertex set
- Independent dominating set
- Maximum induced matching
- Minimum fill-in
- Odd cycle transversal
- Roman domination
- Total dominating set
Loading dependency explorer…
The dependency explorer needs JavaScript and its graph data.