AbstractA chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal graph which has a dominating clique has one as small as the smallest dominating set—and, furthermore, there is a linear-time algorithm to find such a small dominating clique
AbstractWe handle in this paper three dominating clique problems, namely, the decision problem to de...
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal domi...
Listing, generating or enumerating objects of specified type is one of the principal tasks in algori...
AbstractA chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal gr...
AbstractWe study a new version of the domination problem in which the dominating set is required to ...
AbstractLet G = (V, E) be an undirected graph and r be a vertex weight function with positive intege...
We study dominating sets whose induced subgraphs have a bounded diameter. Such sets were used in rec...
AbstractWe present efficient parallel algorithms for the domination problem on strongly chordal grap...
AbstractA set of vertices is a dominating set in a graph if every vertex not in the dominating set i...
AbstractA subset of vertices D⊆V of a graph G=(V,E) is a dominating clique if D is a dominating set ...
AbstractWe present polynomial algorithms to locate minimum weight dominating sets and independent do...
AbstractA cycle C in an undirected and simple graph G is dominating if G - C is edgeless. A graph G ...
In this work we obtain a new graph class where {k}-DOM is NP-complete: the class of chordal graphs. ...
In this work we obtain a new graph class where {k}-DOM is NP-complete: the class of chordal graphs. ...
Listing, generating or enumerating objects of specified type is one of the principal tasks in algori...
AbstractWe handle in this paper three dominating clique problems, namely, the decision problem to de...
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal domi...
Listing, generating or enumerating objects of specified type is one of the principal tasks in algori...
AbstractA chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal gr...
AbstractWe study a new version of the domination problem in which the dominating set is required to ...
AbstractLet G = (V, E) be an undirected graph and r be a vertex weight function with positive intege...
We study dominating sets whose induced subgraphs have a bounded diameter. Such sets were used in rec...
AbstractWe present efficient parallel algorithms for the domination problem on strongly chordal grap...
AbstractA set of vertices is a dominating set in a graph if every vertex not in the dominating set i...
AbstractA subset of vertices D⊆V of a graph G=(V,E) is a dominating clique if D is a dominating set ...
AbstractWe present polynomial algorithms to locate minimum weight dominating sets and independent do...
AbstractA cycle C in an undirected and simple graph G is dominating if G - C is edgeless. A graph G ...
In this work we obtain a new graph class where {k}-DOM is NP-complete: the class of chordal graphs. ...
In this work we obtain a new graph class where {k}-DOM is NP-complete: the class of chordal graphs. ...
Listing, generating or enumerating objects of specified type is one of the principal tasks in algori...
AbstractWe handle in this paper three dominating clique problems, namely, the decision problem to de...
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal domi...
Listing, generating or enumerating objects of specified type is one of the principal tasks in algori...
DOI
Add to ORKG