| lexicalization | eng: Computational problems in graph theory |
| subclass of | (noun) a state of difficulty that needs to be resolved; "she and her husband are having problems"; "it is always a job to contact him"; "urban problems such as traffic congestion and smog"
job, problem |
| has instance | e/Canadian traveller problem |
| has instance | e/Clique cover |
| has instance | e/Connected dominating set |
| has instance | e/Correlation clustering |
| has instance | e/Degree diameter problem |
| has instance | e/Domatic number |
| has instance | e/Edge cover |
| has instance | e/Edge dominating set |
| has instance | e/Feedback arc set |
| has instance | e/Feedback vertex set |
| has instance | e/Graph isomorphism problem |
| has instance | e/Graph partition |
| has instance | e/Induced subgraph isomorphism problem |
| has instance | e/Instant Insanity |
| has instance | e/Longest path problem |
| has instance | e/Maximal independent set |
| has instance | e/Maximum common subgraph isomorphism problem |
| has instance | e/Maximum cut |
| has instance | e/Pebble motion problems |
| has instance | e/Set TSP problem |
| has instance | e/Snake-in-the-box |
| has instance | e/Steiner tree problem |
| has instance | e/Unrooted tree path lengths |
| has instance | e/Vertex cycle cover |