Subgraphs and Supergraphs

Denna tjänst avvecklas 2026-01-19. Läs mer här (länk)

Subgraphs and Supergraphs

Denna tjänst avvecklas 2026-01-19. Läs mer här (länk)

Next: MAXIMUM CLIQUE Up: Graph Theory Previous: MINIMUM CUT COVER Index

Subgraphs and Supergraphs

MAXIMUM CLIQUE
MAXIMUM INDEPENDENT SET
MAXIMUM INDEPENDENT SEQUENCE
MAXIMUM INDUCED SUBGRAPH WITH PROPERTY P
MINIMUM VERTEX DELETION TO OBTAIN SUBGRAPH WITH PROPERTY P
MINIMUM EDGE DELETION TO OBTAIN SUBGRAPH WITH PROPERTY P
MAXIMUM INDUCED CONNECTED SUBGRAPH WITH PROPERTY P
MINIMUM VERTEX DELETION TO OBTAIN CONNECTED SUBGRAPH WITH PROPERTY P
MAXIMUM DEGREE-BOUNDED CONNECTED SUBGRAPH
MAXIMUM PLANAR SUBGRAPH
MINIMUM EDGE DELETION K-PARTITION
MAXIMUM K-COLORABLE SUBGRAPH
MAXIMUM SUBFOREST
MAXIMUM EDGE SUBGRAPH
MINIMUM EDGE K-SPANNER
MAXIMUM K-COLORABLE INDUCED SUBGRAPH
MINIMUM EQUIVALENT DIGRAPH
MINIMUM INTERVAL GRAPH COMPLETION
MINIMUM CHORDAL GRAPH COMPLETION

Viggo Kann
2000-03-20