Subgraphs and Supergraphs

 

 
• GT20 M AXIMUM C LIQUE
• GT21 M AXIMUM I NDEPENDENT S ET
• GT22 M AXIMUM I NDEPENDENT S EQUENCE
• GT23 M AXIMUM I NDUCED S UBGRAPH WITH P ROPERTY P
• GT24 M INIMUM V ERTEX D ELETION TO O BTAIN S UBGRAPH WITH P ROPERTY P
• GT25 M INIMUM E DGE D ELETION TO O BTAIN S UBGRAPH WITH P ROPERTY P
• GT26 M AXIMUM I NDUCED C ONNECTED S UBGRAPH WITH P ROPERTY P
• GT27 M INIMUM V ERTEX D ELETION TO O BTAIN C ONNECTED S UBGRAPH WITH P ROPERTY P
• GT28 M AXIMUM D EGREE -B OUNDED C ONNECTED S UBGRAPH
• GT29 M AXIMUM P LANAR S UBGRAPH
• GT30 M INIMUM E DGE D ELETION K - PARTITION
• GT31 M AXIMUM K -C OLORABLE S UBGRAPH
• GT32 M AXIMUM E DGE S UBGRAPH
• GT33 M INIMUM E DGE 2-S PANNER
• GT34 M AXIMUM K -C OLORABLE I NDUCED S UBGRAPH
• GT35 M INIMUM E QUIVALENT D IGRAPH
• GT36 M INIMUM I NTERVAL G RAPH C OMPLETION
• GT37 M INIMUM C HORDAL G RAPH C OMPLETION
• GT38 M AXIMUM C ONSTRAINED H AMILTONIAN C IRCUIT