Sandwiches missing two ingredients of order four

From MaRDI portal
Publication:2288872




Abstract: For a set calF of graphs, an instance of the calF-{sc free Sandwich Problem} is a pair (G1,G2) consisting of two graphs G1 and G2 with the same vertex set such that G1 is a subgraph of G2, and the task is to determine an calF-free graph G containing G1 and contained in G2, or to decide that such a graph does not exist. Initially motivated by the graph sandwich problem for trivially perfect graphs, which are the P4,C4-free graphs, we study the complexity of the calF-{sc free Sandwich Problem} for sets calF containing two non-isomorphic graphs of order four. We show that if calF is one of the sets leftmdiamond,K4ight, leftmdiamond,C4ight, leftmdiamond,mpawight, leftK4,overlineK4ight, leftP4,C4ight, leftP4,overlinemclawight, leftP4,overlinempawight, leftP4,overlinemdiamondight, leftmpaw,C4ight, leftmpaw,mclawight, leftmpaw,overlinemclawight, leftmpaw,overlinempawight, leftC4,overlineC4ight, leftmclaw,overlinemclawight, and leftmclaw,overlineC4ight, then the calF-{sc free Sandwich Problem} can be solved in polynomial time, and, if calF is one of the sets leftC4,K4ight, leftmpaw,K4ight, leftmpaw,overlineK4ight, leftmpaw,overlineC4ight, leftmdiamond,overlineC4ight, leftmpaw,overlinemdiamondight, and leftmdiamond,overlinemdiamondight, then the decision version of the calF-{sc free Sandwich Problem} is NP-complete.









This page was built for publication: Sandwiches missing two ingredients of order four

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2288872)