{"version":"1.0","type":"link","title":"Graph sandwich problem - Newikis","description":"In graph theory and computer science, the graph sandwich problem is a problem of finding a graph that belongs to a particular family of graphs and is \"sandwiched\" between two other graphs, one of which must be a subgraph and the other of which must be a supergraph of the desired graph.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}