Chordal- (k,ℓ)and strongly chordal- (k,ℓ)graph sandwich problems

Abstract

Background

In this work, we consider the graph sandwich decision problem for property Π, introduced by Golumbic, Kaplan and Shamir: given two graphs G¹=(V,E¹) and G²=(V,E²), the question is to know whether there exists a graph G=(V,E) such that E¹⊆E⊆E² and G satisfies property Π. Particurlarly, we are interested in fully classifying the complexity of this problem when we look to the following properties Π: `G is a chordal- (k,l)-graph' and `G is a strongly chordal- (k,l)-graph', for all k,ℓ.

Methods

In order to do that, we consider each pair of positive values of k and ℓ, exhibiting correspondent polynomial algorithms, or NP-complete reductions.

Results

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 problem is NP-complete, for positive integers k and ℓ such that k+ℓ ≥ 3. Moreover, we prove that both problems are in P when k or ℓ is zero and k+ℓ ≤ 2.

Conclusions

To complete the complexity dichotomy concerning these problems for all nonnegative values of k and ℓ, there still remains the open question of settling the complexity for the case k+ℓ ≥ 3 and one of them is equal to zero.

Background

In 1995, Golumbic, Kaplan and Shamir [1] introduced the SANDWICH PROBLEM:

graph sandwich problem for property Π (Π–sp)

Instance: G¹=(V,E¹) and G²=(V,E²), such that E¹ ⊆E².

Question: Is there a graph G=(V,E) such that E¹⊆E⊆E² and G satisfies property Π?

Observe that the graph G, if it exists, must be `sandwiched' between the graphs G¹ and G² and must satisfy property Π. In order to avoid a trivial problem, we assume that G¹ and G² do not satisfy property Π.

Given two graphs G¹=(V,E¹) and G²=(V,E²) with E¹⊆E², a graph G=(V,E) is called a sandwich graph for the pair (G¹,G²) if E¹⊆E⊆E². Let E^3=E\left(\overline{G^2}\right) denote the set of forbidden edges. We call E¹ the mandatory edge set, and E²\E¹ the optional edge set. Hence, any sandwich graph G=(V,E) for the pair (G¹,G²) must contain all mandatory edges and no forbidden edge.

The recognition problem for a class of graphs is equivalent to the particular graph sandwich problem where E¹=E², that is, the optional edge set is empty. Graph sandwich problems have attracted much attention lately because of many applications and by the fact that they naturally generalize recognition problems [2]-[6]. Note that Π-SP is clearly at least as hard as the problem of recognizing graphs with property Π, since given a polynomial-time algorithm for Π-SP, it is possible to use this algorithm with E¹=E²=E to recognize if a graph G=(V,E) satisfies property Π. Thus, in such cases, we have problems in P that cannot be easier when regarded as sandwich problems.

A graph G=(V,E) is chordal if every cycle of length at least four contains a chord, i.e, an edge between two nonconsecutive vertices. It is well known [7],[8] that chordal graphs can be recognized in polynomial time.

A sun is a chordal graph on 2n vertices (n≥ 3) whose vertex set can be partitioned into W={w₁,…, w _n } and U={u₁,…,u _n } such that W is an independent set, U is a clique and u _i is adjacent to w _j if and only if i=j or i=j+1 (mod n). Strongly chordal graphs were defined by Farber [9] as chordal graphs that do not contain a sun. He also proved that strongly chordal graphs can be recognized in polynomial time.

A bipartite graph is chordal bipartite if each of its cycles of length, at least 6, has a chord.

Let ℓ and k be two non-negative integers. A graph G is (k,ℓ) if V(G) can be partitioned into at most k independent sets and ℓ cliques (a (k,ℓ)-partition). The problem of recognizing if a graph G is (k,ℓ) was shown to be NP-complete if k≥3 or ℓ≥ 3 and solvable in polynomial time otherwise [10]-[12]. In [10],[12],[13], polynomial-time algorithms have been developed for deciding if a graph admits a (2,1) or a (2,2)-partition.

We denote by (ℓ+1)K_k+1 the graph obtained from the disjoint union of (ℓ+1) copies of K_k+1. Chordal- (k,ℓ) graphs have been well studied in the literature. Hell et al. [14]-[16] have analyzed algorithmic and complexity aspects of chordal- (k,ℓ) graphs, proving that the recognition problems of chordal- (k,ℓ) and strongly chordal- (k,ℓ) graphs are in P, using the following characterization:

Theorem 1.

A chordal graph G is (k,ℓ) if and only if G does not contain a (ℓ+1)K_k+1 as an induced subgraph (Figure 1) [[15]].

Figure 1

Example of a 3 K ₅ , the forbidden induced subgraph for chordal- (4,2) graphs.

In [1], Golumbic et al. have presented a diagram showing the complexity status (at that time) of the sandwich problem for some subfamilies of perfect graphs like, for instance, chordal graphs. They have showed that CHORDAL GRAPH SANDWICH PROBLEM is NP-complete. Looking at this diagram, we can notice that the majority of the studied problems are NP-complete. Since then, many other problems, like (2,1)-SP[17] and STRONGLY CHORDAL-SP[5], have been proved to be NP-complete.

In a previous paper [18], we have proved that the STRONGLY CHORDAL- (2, ℓ )GRAPH SANDWICH PROBLEM is NP-complete, for ℓ≥ 1, and that the CHORDAL- ( k,ℓ )GRAPH SANDWICH PROBLEM is NP-complete, for k≥ 2, ℓ≥ 1.

In this paper, we establish the status complexity of the CHORDAL- ( k,ℓ )-SP and STRONGLY CHORDAL- ( k,ℓ )-SP for integers k≥ 1 and ℓ≥ 1: all of them are NP-complete, except CHORDAL-(1,1)-SP proved in P by Golumbic et al. [1]. We show some progress towards the P versus NP dichotomy when k and ℓ are non-negative integers by proving the following in P: CHORDAL- (0, k )-SP, STRONGLY CHORDAL- (0, k )-SP, CHORDAL- ( k ,0)-SP, STRONGLY CHORDAL- ( k ,0)-SP when k=1,2.

Methods

In order to prove that STRONGLY CHORDAL- ( k,ℓ )-SP is NP-complete for k≥ 1 and ℓ≥ 1 we proved first that STRONGLY CHORDAL-(1,1)-SP is in NP-c making a polynomial reduction from the NP-complete sandwich problem for chordal bipartite graphs [6]. After, we proved that both STRONGLY CHORDAL- (1, ℓ )-SP and STRONGLY CHORDAL- ( k ,1)-SP are NP-complete by induction, showing beforehand, that STRONGLY CHORDAL- (1, ℓ +1)-SP and STRONGLY CHORDAL- ( k +1,1)-SP are also NP-complete.

To prove that CHORDAL- ( k,ℓ )-SP is NP-complete for k+ℓ≥ 3, k,ℓ positive integers, we proved first that (2,1) TRIANGULATING COLORED GRAPHS ((2,1) TCG) is NP-complete showing that the instance used to prove that the problem of Triangulating Colored Graphs (TCG) is NP-complete [19] is also a (2,1)-graph. Using this result we proved that CHORDAL-(2,1)-SP is in NP-c. Still using this instance, we proved that CHORDAL-(1,2)-SP is NP-complete. To do that, we changed the set of added edges in order to obtain one independent set and two cliques instead of two independent sets and one clique. After, we proved the NP-completeness of CHORDAL- ( k,ℓ )-SP, for k,ℓ>0 and k+ℓ≥ 3 by induction on k and ℓ.

Finally we proved that (STRONGLY) CHORDAL-(0,2)-SP can be solved in polynomial time by a polynomial reduction to the problem of 2-Satisfability [20]. With this result added to some trivial ones we showed that CHORDAL- (0, k )-SP, STRONGLY CHORDAL- (0, k )-SP, CHORDAL- ( k ,0)-SP, STRONGLY CHORDAL- ( k ,0)-SP when k=1,2 are polynomially solvable.

Results and discussions

Strongly chordal- (k,ℓ) graph sandwich problem

The purpose of this section is to prove that the STRONGLY CHORDAL- ( k,ℓ )-SP is NP-complete for all k,ℓ≥ 1. This problem can be formulated as follows:

strongly chordal- ( k,ℓ ) graph sandwich problem

Instance: G¹=(V,E¹) and G²=(V,E²), such that E¹⊆E².

Question: Is there a graph G=(V,E) such that E¹⊆E⊆E² and G is a strongly chordal- (k,ℓ) graph?

We notice that k and ℓ are not part of the input.

In order to prove the main theorem, we will first present the STRONGLY CHORDAL-(1,1)-SP.

Strongly chordal- (1,1) graph sandwich problem

We prove that the STRONGLY CHORDAL-(1,1) SANDWICH PROBLEM is NP-complete by showing a reduction from the NP-complete problem CHORDAL BIPARTITE GRAPH SANDWICH PROBLEM[6].

Proposition 1.

Let G=(X,Y,E) be a bipartite graph and G^′ be the graph obtained from the addition of edges to X in order to obtain a clique. Then G is chordal bipartite if and only if G^′ is strongly chordal [21].

Notice that, since X is transformed into a clique, G is chordal bipartite if and only if G^′ is strongly chordal-(1,1).

We can formulate the CHORDAL BIPARTITE GRAPH SANDWICH PROBLEM as follows:

chordal bipartite graph sandwich problem

Instance: G¹=(V,E¹) and G²=(V,E²), such that E¹⊆E².

Question: Is there a graph G=(V,E) such that E¹⊆sE⊆E² and G is a chordal bipartite graph?

Theorem 2.

The STRONGLY CHORDAL-(1,1)-SP is NP-complete.

Proof.

The problem is clearly in NP. In order to prove its NP-completeness, we will consider the following special instance (G^{1^{\prime }},G^{2^{\prime }}) of the STRONGLY CHORDAL-(1,1)-SP obtained from (G¹, G²), an instance of the NP-complete problem CHORDAL BIPARTITE-SP[6], such that there is a chordal bipartite sandwich graph G for (G¹,G²) if and only if there is a strongly chordal-(1,1) sandwich graph G^′ for (G^{1^{\prime }},G^{2^{\prime }}).

First, we observe that CHORDAL BIPARTITE-SP is NP-complete even when G¹ is connected. Let G¹ be (X,Y,E¹) and we define G^{1^{\prime }} and G^{2^{\prime }} as follows: G^{1^{\prime }}=(X,Y,E^{1^{\prime }}), where E^{1^{\prime }}=E^1\bigcup \left\{\right(x_i,x_j\left)\right|x_i,x_j\bigcup X\} and G^{2^{\prime }}=(V,E^2\bigcup \{(x_i,x_j)|x_i,x_j\in X\}). This finishes the construction of (G^{1^{\prime }},G^{2^{\prime }}).

The proof of the NP-completeness of the STRONGLY CHORDAL-(1,1) follows from Proposition 1. □

Strongly chordal- (k,ℓ) graph sandwich problem, k ≥ 1, ℓ ≥ 1

After solving the STRONGLY CHORDAL-(1,1)-SP, the question about the complexity of the STRONGLY CHORDAL- ( k,ℓ )-SP, for k≥ 1 and ℓ≥ 1, naturally arises. We have succeeded to prove that the STRONGLY CHORDAL- ( 1,ℓ )-SP, for ℓ≥ 1 and the STRONGLY CHORDAL- ( k ,1)-SP, for k≥ 1, are NP-complete.

Lemma 1.

Given k≥ 1 and ℓ≥ 1, if STRONGLY CHORDAL- ( k,ℓ )-SP is NP-complete, then STRONGLY CHORDAL- ( k,ℓ +1)-SP is NP-complete.

Proof.

We remark that the STRONGLY CHORDAL- ( k,ℓ ) GRAPH SANDWICH PROBLEM, k ≥ 1,ℓ ≥ 1 is in NP, since we can check in polynomial time whether a graph G is a sandwich for a pair (G¹,G²) and whether it is strongly chordal- (k,ℓ) [14]-[16].

We consider the following special instance (G^{1^{\prime }},G^{2^{\prime }}) of STRONGLY CHORDAL- ( k,ℓ +1)-SP obtained from (G¹, G²), an instance of the NP-complete problem STRONGLY CHORDAL- ( k,ℓ )-SP, such that there is a strongly chordal- (k,ℓ) sandwich graph G for (G¹,G²) if and only if there is a strongly chordal- (k,ℓ+1) sandwich graph G^′, k ≥ 1, ℓ ≥ 1, for (G^{1^{\prime }},G^{2^{\prime }}).

From (G¹,G²), we define one additional clique K, such that |K|=k+1. We set V\left(G^{1^{\prime }}\right)=V\left(G^{2^{\prime }}\right)=V(G¹) ⋃ V(K), E\left(G^{1^{\prime }}\right)=E¹⋃E(K) and E\left(G^{2^{\prime }}\right)=E²⋃E(K). This concludes the construction of the instance (G^{1^{\prime }},G^{2^{\prime }}) (see Figure 2 as an example).

Figure 2

Example of the instance when k =2 and ℓ =1. Note that when G has two isolated triangles, G^′ will have three isolated triangles.

Suppose there is a strongly chordal- (k,ℓ) sandwich graph G for (G¹,G²). Consider G^′ formed by G plus the forced edges of (G^{1^{\prime }},G^{2^{\prime }}). In order to prove that graph G^′ is a strongly chordal graph, we consider the strong elimination sequence started by any sequence of the vertices of K, followed by a strong elimination sequence of the strongly chordal graph G. In order to prove that G^′ is (k,ℓ+1),k ≥ 1 and ℓ ≥ 1, we consider a (k,ℓ)-partition for G, and we set a (k,ℓ+1)-partition for G^′ formed by the k independent sets, the ℓ cliques of G, and K.

Suppose there is a strongly chordal- (k,ℓ+1) sandwich graph G^′ for (G^{1^{\prime }},G^{2^{\prime }}), k ≥ 1 and ℓ ≥ 1. Given G=G^′-K, we will prove that G is a strongly chordal- (k,ℓ) sandwich graph for (G¹,G²). Suppose by contradiction that G is not a strongly chordal- (k,ℓ) graph. First, note that, since being a strongly chordal graph is an hereditary property, G must be strongly chordal. Thus, if G is not strongly chordal- (k,ℓ) then it is because G is not a (k,ℓ)-graph. It follows from Theorem 1 that G contains a (ℓ+1)(K_k+1) as an induced subgraph. Since G^′ is the disjoint union of G and K, there is an induced subgraph (ℓ+2)K_k+1 of G^′ formed by K and the induced subgraph (ℓ+1)(K_k+1) of G. By Theorem 1, G^′ is not strongly chordal- (k,ℓ+1), a contradiction. Hence, G is a strongly chordal- (k,ℓ) graph. □

Theorem 3.

STRONGLY CHORDAL- (1, ℓ )-SP, for ℓ ≥ 1, is NP-complete.

Proof.

The proof of Theorem 3 is done by induction using Theorem 2 and Lemma 1. □

Lemma 2.

Given k ≥ 1, STRONGLY CHORDAL- ( k ,1)-SP is NP-complete.

Proof.

We remark that the STRONGLY CHORDAL- ( k ,1) GRAPH SANDWICH PROBLEM, k ≥ 1 is in NP, since we can check in polynomial time whether a graph G is a sandwich for a pair (G¹,G²) and whether it is strongly chordal- (k,ℓ) [9],[15].

We consider the following special instance (G^{1^{\prime }},G^{2^{\prime }}) of STRONGLY CHORDAL- ( k ,1)-SP obtained from (G¹, G²), a connect instance of the NP-complete problem CHORDAL BIPARTITE-SP[6], such that there is a chordal bipartite sandwich graph G=(V,E) for (G¹,G²) if and only if there is a strongly chordal- (k,1) sandwich graph G^′, k ≥ 1 for (G^{1^{\prime }},G^{2^{\prime }}).

Notice that if there exists G a chordal bipartite sandwich graph, then G¹=(V,E¹) must be bipartite. Let G¹=(X,Y,E¹). Given Y={y₁,y₂,…,y _q }, we describe

V\left(G^{1^{\prime }}\right)=V\left(G^{2^{\prime }}\right)=

V⋃{w₁,w₂,…,w_k-1} and

E\left(G^{1^{\prime }}\right)=E\left(G^{2^{\prime }}\right)=E^1\bigcup \left\{\right(x_i,x_j\left)\right|x_i,x_j\in X\}

⋃{(w _i ,w _j ), (w _i ,y₁)|i≠j; i,j∈ {1,2,…,k-1}}.

This concludes the construction of the instance (G^{1^{\prime }},G^{2^{\prime }}) (see Figure 3 as an example).

Figure 3

Example of the construction of the instance when k =3.

We will prove now that there exists G a chordal bipartite sandwich graph for (G¹,G²) if and only if there exists G^′ a strongly chordal- (k,1) sandwich graph for (G^{1^{\prime }},G^{2^{\prime }}).

Suppose that G is a chordal bipartite sandwich graph for (G¹,G²). Let G^′ be the graph where V\left(G^{\prime }\right)=V\left(G^{1^{\prime }}\right) and E(G^′)=E(G)⋃{(w _i ,w _j ), (w _i ,y₁)|i≠j; i,j∈{1,2,…,k-1}}⋃{(x _i ,x _j )|x _i ,x _j ∈X}. We will prove that G^′ is strongly chordal and we will exhibit the partition of its vertex set into k independent sets and one clique. Observe that a sun of G^′ entirely belongs to a block of G^′. Since y₁ is a cut-vertex, we have that a sun of G^′ belongs to the graph G^′ [V]. By the Proposition 1, G^′ [V] is strongly chordal. Hence, we can ensure that G^′ is strongly chordal. Moreover, we can exhibit the (k,1)-partition of G^′: Each vertex of {y₁,w₁,w₂,…,w_k-1} participates of an independent set and the clique is induced by X.

Now suppose that G^′ is a strongly chordal- (k,1) sandwich graph for (G^{1^{\prime }},G^{2^{\prime }}). We prove next that G=(V,E), where E={E(G^′)\{(x _i ,x _j )|x _i ,x _j ∈X}. We observe that the instance (G¹,G²) of the NP-complete sandwich problem for chordal bipartite graphs [6] can be assumed to satisfy that G¹ is connected and G² is bipartite. Suppose by contradiction, that G contains a C₆. In this case, we would have a sun in G^′ [V], and this is a contradiction. □

Theorem 4.

STRONGLY CHORDAL- ( k,ℓ )-SP is NP-complete for k ≥ 1 and ℓ ≥ 1.

Proof.

This proof follows from Lemma 2 and Theorem 3. □

Chordal- (k,ℓ) graph sandwich problem

This problem can be formulated as follows:

chordal- ( k,ℓ ) graph sandwich problem

Instance: G¹=(V,E¹) and G²=(V,E²), such that E¹⊆E².

Question: Is there a graph G=(V,E) such that E¹⊆E⊆E² and G is a chordal- (k,ℓ) graph?

From the literature, we know that the CHORDAL-(1,1)-SP is polynomially solvable [1]. In order to prove the main theorem of this section, we will first present the proof that CHORDAL-(2,1)-SP is NP-complete. We observe that this result is stated in [18], but the proof was omitted.

Chordal- (2,1) graph sandwich problem

Theorem 5.

CHORDAL-(2,1)-SP is NP-complete.

Proof.

This proof follows from the NP-completness proof of TRIANGULATING COLORED GRAPHS (TCG)[19] and of CHORDAL-SP[1]. We can fomally define TCG as follows:

triangulating colored graphs (tcg)

Input: A graph G=(V,E) and a proper vertex coloring c:V\to \mathbb{Z}.

Question: Does there exist a supergraph G^′=(V,E^′) of G that is chordal and properly colored on vertices by c?

First, we will prove that the (2,1)-TRIANGULATING COLORING GRAPHS ((2,1)-TCG) is NP-complete. This problem cam be formulated as follows:

(2,1)-triangulating colored graphs ((2,1)tcg)

Input: A graph G=(V,E) and a proper vertex coloring c:V\to \mathbb{Z}.

Question: Does there exist a supergraph G^′=(V,E^′) of G that is chordal-(2,1) and properly colored on vertices by c?

We will use the same polynomial reduction from THREE-SATIFIABILITY PROBLEM (3SAT) [20] that was used by Bodlaender et al. to prove that TCG is NP-complete, and we will show that the instance used is also a (2,1)-graph. So, we will first present here the particular chordal graph they have constructed.

For our purposes, we will consider a graph G _I obtained by an instance I of 3SAT that is composed by a decision component and some clause components. We will suppose that any clause contains both a literal and its complement. For each variable X or its complement \stackrel{-}{X} contained in a clause i of I we have a decision component like the one of Figure 4.

Figure 4

Colored decision component.

Each decison component has the vertex set: H (head), S_X,S_{\stackrel{-}{X}} (shoulders), K_X^i,K_{{\stackrel{-}{X}}^i} (knees) and F (foot). The instance G _I has only one head and one foot, a pair of shoulders for each variable X of I and a pair of knees for each occurence of X or \stackrel{-}{X} in a clause i of I. Moreover, as we can see in Figure 4, head and foot will receive the same color. We will do the same for each pair of shoulders S_X,S_{\stackrel{-}{X}} and for each pair of knees K_X^i,K_{\stackrel{-}{X}}^i. Note that each color is assigned to exactly two vertices.

In order to triangulate the component related to the variable X, we can add either the set of edges \left(H,K_X^i\right),\left(S_X,K_X^i\right),\left(S_X,F\right) or the set of edges \left(H,K_{\stackrel{-}{X}}^i\right), \left(S_{\stackrel{-}{X}},K_{\stackrel{-}{X}}^i\right),(S_{\stackrel{-}{X}},F). We call the first set as Mark of Zorro on positive orientation and the second set as Mark of Zorro on negative orientation (Figure 5). Furthermore, we add either all edges \left(H,K_X^i\right) or all edges \left(H,K_{\stackrel{-}{X}}\right).

Figure 5

Marks of Zorro in positive and negative orientations, from left to right.

If the Mark of Zorro is positively oriented in the decision component of X, the literal X will be set as TRUE. Otherwise, it will be set as FALSE.

To construct a clause component, we will not add vertices to G _I . We will just add some edges between some knees.

Let L be a literal of the clause i. We say that K_L^i is an active knee and K_{\stackrel{-}{L}}^i is an inactive knee.

Consider f as a truth assignment that satisfies the instance I of 3SAT. In this case, there exists at least one true literal in each clause. We will rename the variables in order to have X as a true literal and \stackrel{-}{X} as a false literal.

We have finally constructed the graph G _I (see Figure 6 as an example) and we will transform this graph in one that is chordal and (2,1). So, we will add some edges and prove that these edges turn G _I into a (2,1)-graph. The proof that it is also a chordal graph can be found in [19].

Figure 6

Example of graph G _I obtained from the instance U=\{X,Y,Z\},C=\left\{\right(\stackrel{-}{X},Y,Z),(\stackrel{-}{X},\stackrel{-}{Y},Z\left)\right\} of 3SAT .

To transform G _I into a chordal-(2,1) graph, we will add

The edges of the positive orientation of the Mark of Zorro;

Edges that compose the complete graph formed by true shoulders and true knees; and

Edges such that true shoulders are adjacent to all false knees.

Bodlaender et al. have proved that this modified instance is a chordal graph [19]. In order to show that this graph is also a (2,1)-graph, we will prove that it does not contain a pair of isolated triangles [15].

Observing the set of edges we have added in order to transform G _I into a chordal-(2,1) graph, we can see that each triangle formed by the addition of these edges has at least one true shoulder or at least one true knee. However, the clause components form three types of triangles in the graph:

• 1. Triangles composed by active knees.

In this case, since the truth assignment must satisfy the instance I, all triangles must have at least one true knee.

• 2. Triangles composed by the foot and one true knee; and

• 3. Triangles composed by two false knees and the foot.

Note that the third type of triangles do not have true knees or true shoulders, but they have a common vertex: F. Also note that the foot is adjacent to all knees and to all true shoulders. Thus, this type of triangle is not isolated from any other triangle of the graph, and then we can state that this modified instance is a (2,1)-graph. Therefore, we can also exhibit the (2,1)-partition.

Clique - True shoulders, true knees and the foot.

Independent sets

S₁: The head, active false knees adjacent to inactive true knees, inactive false knees.

S₂: False shoulders, active false knees adjacent to inactive false knees.

Note that the head is not adjacent to false knees, and active false knees adjacent to inactive true knees are not adjacent to inactive false knees, even when they are from distinct clauses. Moreover, false shoulders are not adjacent to false knees. Hence, this (2,1)-partition is well defined. □

Chordal- (1,2) graph sandwich problem

In order to prove that CHORDAL-(1,2) GRAPH SANDWICH PROBLEM is NP-complete, we will use the same instance G _I used to prove that CHORDAL-(2,1)-SP is NP-complete.

Lemma 3.

The instance I of 3-SAT is satisfiable if and only if there is a (1,2)-triangulation for G _I respecting the proper coloring of G _I .

Proof.

The sufficiency proof of Lemma 3 is already done in [19].

In order to prove its necesssity, suppose that there is a satisfiable truth assignment f for I. We will add the following set of edges in order to obtain a chordal-(1,2) graph respecting the proper coloring of G _I .

The positive orientation of Mark of Zorro for each decision component;

All edges between true knees and true shoulders, in order to obtain a clique;

Edges such that every true shoulder sees every false knee;

All edges between active knees, and

Edges between inactive true knees adjacent to active false knees and active false knees adjacent to inactive true knees

Let G₁ be the instance G _I plus these additional edges and consider the following sets:

S₁={False shoulders, inactive false knees };

S₂={Head};

S₃={Inactive true knee adjacent to an active true knee };

S₄={Active false knee adjacent to an inactive false knee };

S₅={Active false knee adjacent to an inactive true knee (in the same clause component) }, and

S₆={Active true knees, true shoulders, foot }.

First, observe that these added edges are in the set of optional edges of G _I . After, lets analyze the neighborhoods of each vertex of these sets.

False shoulders are adjacent to the head and to some true knees. Since head and true knees form a clique, each false shoulder is a simplicial vertex that can be removed. Inactive false knees are adjacent to the foot, to true shoulders and to an active knee (true or false). This set is also a clique and inactive false knees are simplicial vertices as well, so they can be deleted. Let G₂ be the resulting graph after these remotions.

The neighborhood of the head in G₂ is formed by true shoulders and true knees, what induces a clique in G₂. Then the head is a simplicial vertex that can be removed of the graph. Let G₃ be the graph after the remotion of the Head.

The vertices of S₃ in G₃ are adjacent to the foot, to true shoulders and to true knees. Again, this set of vertices induces a clique in G₃. So, inactive true knees adjacent active true knees are simplicial vertices in G₃ that can be deleted forming G₄.

The vertices of S₄ in G₄ are adjacent to true shoulders, to the foot and to all active knees (true or false). Active knees form a clique as well as true shoulders and the foot sees every knee and every true shoulder. Moreover, true shoulders are adjacent to all knees. So, this neighborhood is also a clique what characterizes each active false knee adjacent to an inactive false knee as a simplicial vertex in G₄. Let G₅ be the graph after the remotion of all active false knee adjacent to an inactive false knee.

The vertices of S₅ are adjacent to all active knees, to all inactive true knees adjacent to an active false knee, to true shoulders and to the foot in G₅. This neighborhood induces a clique, and, because of that, active false knees adjacent to inactive true knees can be removed in this step. Let G₆ be the resulting graph, after the remotion of vertices of S₅.

Clearly G₆ is a clique.

Observe that, if we follow the order of the sets, any elimination ordering of vertices applied to each set creates a perfect elimination ordering for the graph G₁. Moreover, we can present a (1,2)-partition for the vertex set of G₁:

Independent set - False shoulders and inactive false knees.

Clique 1 - Head, true shoulders and true knees.

Clique 2 - Foot and active false knees.

This concludes the proof of Lemma 3. □

Theorem 6.

CHORDAL-(1,2)-SP is NP-complete.

Proof.

Clearly, CHORDAL-(1,2)-SP is in NP. The NP-completeness proof follows from the polynomial redution done in Lemma 3. □

Chordal- (k,ℓ) graph sandwich problem, k ≥ 1, ℓ ≥ 2

Lemma 4.

Given k and ℓ positive integers such that k+ℓ≥3, if CHORDAL- ( k,ℓ )-SP is NP-complete, then CHORDAL- (k+1,ℓ)-SP is NP-complete.

Proof.

Observe that the CHORDAL- ( k,ℓ ) GRAPH SANDWICH PROBLEM, k,ℓ>0 and k+ℓ≥ 3, is in NP, since we can check in polynomial time whether a graph G is a sandwich for a pair (G¹,G²) and whether it is chordal- (k,ℓ) [15].

We consider the following special instance (G^{1^{\prime }},G^{2^{\prime }}) of the problem CHORDAL- ( k+1,ℓ )-SP obtained from (G¹,G²), an instance of the NP-complete problem CHORDAL- ( k,ℓ )-SP, such that there is a (k,ℓ)-chordal sandwich graph G for (G¹,G²) if and only if there is a (k+1,ℓ)-chordal sandwich graph G^′, k,ℓ>0 and k+ℓ ≥ 3, for (G^{1^{\prime }},G^{2^{\prime }}).

We denote by n₁ and n₂, respectively, the number of K_k+1's of G¹ and G². Let K_{k+1}^1,K_{k+1}^2,\dots ,K_{k+1}^{n_2} be the subgraphs of G² isomorphic to K_k+1. For each K_{k+1}^i of G² we define one additional vertex u _i , such that V\left(K_{k+1}^i\right)\bigcup \left\{u_i\right\} forms a clique Kⁱ, i=1,… ,n₂. We set V\left(G^{1^{\prime }}\right)=V\left(G^{2^{\prime }}\right)=V\left(G^1\right)\bigcup _{i=1}^{n_2}\left\{u_i\right\}, E\left(G^{1^{\prime }}\right)=E^1\bigcup _{i=1}^{n_1}E\left(K^i\right), and E\left(G^{2^{\prime }}\right)=E^2\bigcup _{i=1}^{n_2}E\left(K^i\right). This concludes the construction of the instance (G^{1^{\prime }},G^{2^{\prime }}).

Suppose there is a chordal- (k,ℓ) sandwich graph G for (G¹,G²). Consider G^′ formed by G plus the forced edges of (G^{1^{\prime }},G^{2^{\prime }}). In order to prove that G^′ is a chordal graph, we consider the perfect elimination sequence started by the simplicial vertices u _i , i=1,…,n₂, and followed by a perfect elimination sequence of the chordal graph G. To prove that G^′ is a (k+1,ℓ)-graph, k,ℓ>0 and k+ℓ ≥ 3, we consider a (k,ℓ)-partition of G, and we define a (k+1,ℓ)-partition for G^′ formed by the k independents sets of G, the independent set \bigcup _{i=1}^{n_2}\left\{u_i\right\}, and the ℓ cliques of G.

Suppose there is a chordal- (k+1,ℓ) sandwich graph G^′ for (G^{1^{\prime }},G^{2^{\prime }}), k,ℓ>0 and k+ℓ≥3. We consider G=G^{\prime }-\bigcup _{i=1}^{n_2}\left\{u_i\right\} and we will prove that G is a chordal- (k,ℓ)-sandwich graph for (G¹,G²). Suppose by contradiction that G is not a chordal- (k,ℓ) graph. Note that, since being a chordal graph is an hereditary property, if G is not chordal then G^′ is not chordal either. It follows from Theorem 1 that G contains a (ℓ+1)K_k+1 as an induced subgraph (see Figure 1). By construction of G^′, for each K_{k+1}^i of G² there is an additional vertex u _i forming a K_k+2 in G^{2^{\prime }} (see Figure 7 for an example). Then, we have (ℓ+1) copies of K_k+2 in G^′ which, by the characterization in [15], implies that G^′ is not chordal- (k+1,ℓ). Hence, G must be chordal- (k,ℓ). □

Figure 7

Example of the addition of vertices u _i when k =2 and ℓ =1. Note that when G has two isolated triangles, G^′ will have two isolated K₄'s.

Theorem 7.

CHORDAL- ( k,ℓ )-SP, for k,ℓ>0 and k+ℓ ≥ 3, is NP-complete.

Proof.

The proof of Theorem 7 is done by a two-step mathematical induction on k and ℓ where the induction bases follow from Theorems 5 and 6 and the inductive steps follow from Lemma 1 and Lemma 4. □

Chordal- (k,ℓ) graph sandwich problem when k=0 or ℓ=0

Observe first that (1,0) and (2,0) are hereditary polynomial time checkable properties, and that a (2,0)-graph G is chordal if and only if G is acyclic. Hence, in both cases, in order to have a positive answer for the sandwich problem, G¹ must satisfy the required property. Therefore, (STRONGLY) CHORDAL-(1,0)-SP and (STRONGLY) CHORDAL-(2,0)-SP are polynomially solvable. Moreover, since the existence of a chordal-(0,1) sandwich graph depends on G² being a clique, we have that (STRONGLY) CHORDAL-(0,1)-SP is polynomially solvable as well.

Chordal- (0,2) graph sandwich problem

The following Lemma allows us to analyze the complexity of the (STRONGLY) CHORDAL-(0,2) GRAPH SANDWICH PROBLEM.

Lemma 5.

G is chordal-(0,2) if and only if G is strongly chordal-(0,2).

Proof.

If G is chordal-(0,2), then G cannot have a sun as an induced subgraph since, in this case, the size of an independent set is at most 2.

If G is strongly chordal-(0,2), then G is chordal-(0,2) by definition. □

Theorem 8.

CHORDAL-(0,2)-SP is polynomially solvable.

Proof.

In order to define an algorithm for CHORDAL-(0,2) sandwich graph problem we use a polynomial reduction to the poly-time problem 2SAT. With this purpose, from the vertex u and the partition (V₁,V₂) into two cliques for V, we define the Boolean variable:

u^i=T\rightleftharpoons u

belongs to the part V _i ,i∈{1,2}.

Given a CHORDAL-(0,2) sandwich instance (G¹,G²).

We assume that there is no universal vertex in G² since in a (0,2)-partition, this vertex can be added to any part. Next, we describe our polynomial time algorithm to CHORDAL-(0,2)-SP.

Correctness: We notice that if I=(U,C) is satisfiable, then a chordal-(0,2) sandwich graph G is obtained for the CHORDAL-(0,2) instance (G₁,G₂) by setting vertex u on V₁ if and only if variable u¹ is true and on V₂ otherwise. The only optional edges added are the edges between vertices inside a same part either V₁ or V₂.

In order to see that, notice that clauses in 2a provide that the endpoints of each forbidden edge belong to a part of the partition (V₁,V₂). Clauses in 2b provide that each endpoint of each forbidden edge belong to exactly one part of the partition (V₁,V₂). Clauses in 2c provide that if one endpoint of a forbidden edge belong to one part, then the other endpoint belongs to the other part of the partition (V₁,V₂). Finally, clauses in 3 provide that from a satisfiable solution for I=(U,C), there is no C₄ in G.

Suppose that there is a chordal sandwich graph G with partition into cliques (V₁,V₂) for the CHORDAL-(0,2) instance (G₁,G₂). We assume that all the optional edges of G belong to either G [V₁] or G [V₂]. Hence, no forbidden edge is allowed inside V₁ or V₂, and no C₄ have two forced edges connecting vertices from V₁ to V₂. Hence, there is a satisfiable solution for I=(U,C) such that the sandwich graph G is obtained for the CHORDAL-(0,2) instance (G₁,G₂). □

Conclusions

Figure 8 summarizes the results of this paper and presents open problems.

Figure 8

Our contribution to Golumbic et al.'s former diagram in [[1]].