graph sandwich problem (Q5597096)

From Wikidata
Jump to navigation Jump to search
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
edit
Language Label Description Also known as
English
graph sandwich problem
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

    Statements

    Identifiers

     
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit