 Graph sandwich problem

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 \).