721 search results - page 18 / 145 » Bounds on the k-domination number of a graph |
146
click to vote
SSS
2010
Springer
15 years 5 months ago
2010
Springer
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
192
click to vote
JSYML
2010
15 years 1 months ago
2010
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
190
click to vote
IWOCA
2009
Springer
16 years 1 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
168
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
169
click to vote
GD
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings...