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
AbstractA set of vertices is a dominating set in a graph if every vertex not in the dominating set i...
AbstractLet G = (V, E) be an undirected graph and r be a vertex weight function with positive intege...
International audienceWe handle in this paper three dominating clique problems, namely, the decision...
AbstractA chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal gr...
The maximum number of minimal dominating sets in a chordal graph on n vertices is known to be at m...
AbstractWe study a new version of the domination problem in which the dominating set is required to ...
We study dominating sets whose induced subgraphs have a bounded diameter. Such sets were used in rec...
A clique-tree representation of a chordal graph often reduces the size of the data structure needed ...
AbstractA subset of vertices D⊆V of a graph G=(V,E) is a dominating clique if D is a dominating set ...
A set $S\subseteq V(G)$ of a graph $G$ is a dominating set if each vertex has a neighbor in $S$ or b...
A set $S\subseteq V(G)$ of a graph $G$ is a dominating set if each vertex has a neighbor in $S$ or b...
In a graph G, a vertex is said to dominate itself & all of its neighbors. For a fixed positive integ...
In this work we obtain a new graph class where the {. k}-dominating function problem ({. k}-DOM) is ...
In 2008, a unified approach (labeled domination) to several domination problems (k-tuple domination,...
AbstractWe present polynomial algorithms to locate minimum weight dominating sets and independent do...
AbstractA set of vertices is a dominating set in a graph if every vertex not in the dominating set i...
AbstractLet G = (V, E) be an undirected graph and r be a vertex weight function with positive intege...
International audienceWe handle in this paper three dominating clique problems, namely, the decision...
AbstractA chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal gr...
The maximum number of minimal dominating sets in a chordal graph on n vertices is known to be at m...
AbstractWe study a new version of the domination problem in which the dominating set is required to ...
We study dominating sets whose induced subgraphs have a bounded diameter. Such sets were used in rec...
A clique-tree representation of a chordal graph often reduces the size of the data structure needed ...
AbstractA subset of vertices D⊆V of a graph G=(V,E) is a dominating clique if D is a dominating set ...
A set $S\subseteq V(G)$ of a graph $G$ is a dominating set if each vertex has a neighbor in $S$ or b...
A set $S\subseteq V(G)$ of a graph $G$ is a dominating set if each vertex has a neighbor in $S$ or b...
In a graph G, a vertex is said to dominate itself & all of its neighbors. For a fixed positive integ...
In this work we obtain a new graph class where the {. k}-dominating function problem ({. k}-DOM) is ...
In 2008, a unified approach (labeled domination) to several domination problems (k-tuple domination,...
AbstractWe present polynomial algorithms to locate minimum weight dominating sets and independent do...
AbstractA set of vertices is a dominating set in a graph if every vertex not in the dominating set i...
AbstractLet G = (V, E) be an undirected graph and r be a vertex weight function with positive intege...
International audienceWe handle in this paper three dominating clique problems, namely, the decision...
DOI
Add to ORKG