Graph Theory

 

 
• Covering and Partitioning
  • GT1 M INIMUM V ERTEX C OVER
  • GT2 M INIMUM D OMINATING S ET
  • GT3 M INIMUM E DGE D OMINATING S ET
  • GT4 M INIMUM I NDEPENDENT D OMINATING S ET
  • GT5 M INIMUM G RAPH C OLORING
  • GT6 M AXIMUM A CHROMATIC N UMBER
  • GT7 M INIMUM E DGE C OLORING
  • GT8 M INIMUM F EEDBACK V ERTEX S ET
  • GT9 M INIMUM F EEDBACK A RC S ET
  • GT10 M AXIMUM T RIANGLE P ACKING
  • GT11 M AXIMUM H-M ATCHING
  • GT12 M INIMUM B OTTLENECK P ATH M ATCHING
  • GT13 M INIMUM C LIQUE P ARTITION
  • GT14 M INIMUM K -C APACITATED T REE P ARTITION
  • GT15 M INIMUM C LIQUE C OVER
  • GT16 M INIMUM C OMPLETE B IPARTITE S UBGRAPH C OVER
  • GT17 M INIMUM V ERTEX D ISJOINT C YCLE C OVER
  • GT18 M INIMUM E DGE D ISJOINT C YCLE C OVER
  • GT19 M INIMUM C UT C OVER
• 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
• Vertex Ordering
  • GT39 M INIMUM B ANDWIDTH
  • GT40 M INIMUM L INEAR A RRANGEMENT
  • GT41 M INIMUM C UT L INEAR A RRANGEMENT
• Iso- and Other Morphisms
  • GT42 M AXIMUM C OMMON S UBGRAPH
  • GT43 M AXIMUM C OMMON I NDUCED S UBGRAPH
  • GT44 M AXIMUM C OMMON E MBEDDED S UB - TREE
  • GT45 M INIMUM G RAPH T RANSFORMATION
• Miscellaneous
  • GT46 L ONGEST P ATH WITH F ORBIDDEN P AIRS
  • GT47 S HORTEST P ATH WITH F ORBIDDEN P AIRS
  • GT48 M INIMUM P OINT -T O -P OINT C ONNECTION
  • GT49 M INIMUM M ETRIC D IMENSION
  • GT50 M INIMUM T REE W IDTH
  • GT51 M INIMUM G RAPH I NFERENCE