Sciweavers

3204 search results - page 65 / 641
» The Alcuin Number of a Graph
Sort
View
DM
2008
119views more  DM 2008»
13 years 8 months ago
A generalised upper bound for the k-tuple domination number
In this paper, we provide an upper bound for the k-tuple domination number that generalises known upper bounds for the double and triple domination numbers. We prove that for any ...
Andrei Gagarin, Vadim E. Zverovich
APPML
2008
82views more  APPML 2008»
13 years 8 months ago
The k-tuple domination number revisited
The following fundamental result for the domination number (G) of a graph G was proved by Alon and Spencer, Arnautov, Lov
Vadim E. Zverovich
DM
2000
91views more  DM 2000»
13 years 7 months ago
Perfection thickness of graphs
We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n-vertex graph.
Hirotsugu Asari, Tao Jiang, André Künd...
MST
2006
99views more  MST 2006»
13 years 8 months ago
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
Tobias Riege, Jörg Rothe
GD
2006
Springer
13 years 11 months ago
The Number of Triangulations on Planar Point Sets
We give a brief account of results concerning the number of triangulations on finite point sets in the plane, both for arbitrary sets and for specific sets such as the n
Emo Welzl