The (k,l)-Graph Sandwich Problem asks, given two graphs G1=(V,E1) and G2=(V,E2), whether there exists a graph G=(V,E) such that E1⊆E⊆E2 and G is (k,l). In this paper, we prove that the (k,l)-Graph Sandwich Problem is NP-complete for the cases k=1 and l=2; k=2 and l=1; or k=l=2.
Abstract. A graph G is (k, l) if its vertex set can be partitioned into at most k independent sets and l cliques. The (k, l)-Graph Sandwich. Problem asks�...
Abstract. A graph G is (k; l) if its vertex set can be partitioned into at most k independent sets and l cliques. The (k; l)-Graph. Sandwich Problem asks�...
In this work we consider the Golumbic, Kaplan and Shamir graph sandwich decision problem for property Π, where given two graphs G 1 = (V,E 1) and G 2 = (V,E�...
Sep 11, 2014 � We prove that the strongly chordal- ( k,ℓ ) graph sandwich problem is NP-complete, for k≥1 and ℓ≥1, and that the chordal- ( k,ℓ ) graph sandwich�...
It is shown how boundary conditions can change the complexity status of a graph sandwich problem, and a polynomial-time solution is presented for the (k�...
The (k, l)-Graph Sandwich Problem asks, given two graphs G 1 = (V,E 1 ) and G 2 = (V,E 2 ), whether there exists a graph G = (V,E) such that E 1 ⊆ E ⊆ E 2 and G�...
The (k, l) -Graph Sandwich Problem asks, given two graphs G 1 = ( V,E 1) and G 2 = ( V, E 2), whether there exists a graph G = ( V, E ) such that E 1 E E 2 and�...
The (k,l)-Graph Sandwich Problem asks, given two graphs G1=(V,E1) and G2=(V,E2), whether there exists a graph G=(V,E) such that E1⊆E⊆E2 and G is (k,l). In this�...
Jul 15, 2020 � In this paper, we present a structural characterization and a decomposition theorem for -cographs and, consequently, for -cographs, leading to linear time�...