AbstractThe notion of a boundary class has been recently introduced as a tool for classification of hereditary classes of graphs according to the time complexity of NP-hard graph problems. In the present paper we concentrate on the dominating set problem and obtain three boundary classes for it
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of ma...
Given a graph class C, it is natural to ask whether a given graph has a connected or a total dominat...
The dominating induced matching problem, also known as efficient edge domination, is the problem of ...
AbstractThe notion of a boundary class has been recently introduced as a tool for classification of ...
AbstractAny graph problem, which is NP-hard in general graphs, becomes polynomial-time solvable when...
AbstractIn this paper we introduce the concept of a boundary class, which is a helpful tool for clas...
Anupper dominating set in a graph is a minimal dominating set of maximum cardinality. The problem o...
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of m...
An upper dominating set in a graph is a minimal dominating set of maximum cardinality. The problem o...
AbstractWe study the following question: given a finite collection of graphs G1,…,Gk, is the dominat...
The results of this paper previously appeared as extended abstracts in proceedings of the 8th Intern...
AbstractWe investigate Independent Domination Problem within hereditary classes of graphs. Boliac an...
AbstractThe dominating induced matching problem, also known as efficient edge domination, is the pro...
AbstractThe notion of a boundary graph property was recently introduced as a relaxation of that of a...
LNCS n°9843An upper dominating set in a graph is a minimal (with respect to set inclusion) dominatin...
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of ma...
Given a graph class C, it is natural to ask whether a given graph has a connected or a total dominat...
The dominating induced matching problem, also known as efficient edge domination, is the problem of ...
AbstractThe notion of a boundary class has been recently introduced as a tool for classification of ...
AbstractAny graph problem, which is NP-hard in general graphs, becomes polynomial-time solvable when...
AbstractIn this paper we introduce the concept of a boundary class, which is a helpful tool for clas...
Anupper dominating set in a graph is a minimal dominating set of maximum cardinality. The problem o...
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of m...
An upper dominating set in a graph is a minimal dominating set of maximum cardinality. The problem o...
AbstractWe study the following question: given a finite collection of graphs G1,…,Gk, is the dominat...
The results of this paper previously appeared as extended abstracts in proceedings of the 8th Intern...
AbstractWe investigate Independent Domination Problem within hereditary classes of graphs. Boliac an...
AbstractThe dominating induced matching problem, also known as efficient edge domination, is the pro...
AbstractThe notion of a boundary graph property was recently introduced as a relaxation of that of a...
LNCS n°9843An upper dominating set in a graph is a minimal (with respect to set inclusion) dominatin...
An upper dominating set in a graph is a minimal (with respect to set inclusion) dominating set of ma...
Given a graph class C, it is natural to ask whether a given graph has a connected or a total dominat...
The dominating induced matching problem, also known as efficient edge domination, is the problem of ...