The Graph Sandwich Problem is a problem in graph theory that involves determining whether a certain graph can be found between two given graphs. More formally, given two graphs \( G_1 \) and \( G_2 \), the problem asks whether there exists a graph \( G \) such that \( G_1 \) is a subgraph of \( G \) and \( G \) is a subgraph of \( G_2 \).

Ancestors (5)

  1. Computational problems in graph theory
  2. Computational mathematics
  3. Fields of mathematics
  4. Mathematics
  5. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version