2432 search results - page 29 / 487 » Degrees and choice numbers |
212
Voted
ICDCN
2011
Springer
14 years 5 months ago
2011
Springer
This paper considers the problem of calculating dominating sets in networks with bounded degree. In these networks, the maximal degree of any node is bounded by Δ, which is usuall...
126
Voted
RSA
2006
15 years 1 months ago
2006
We study the asymptotic behaviour of the number Nk,n of nodes of given degree k in unlabeled random trees, when the tree size n and the node degree k both tend to infinity. It is s...
113
Voted
JGT
2010
15 years 10 days ago
2010
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter fo...
117
click to vote
FFA
2006
15 years 1 months ago
2006
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal. First we extend the method of the previous paper proving an asymptotic formul...
115
click to vote
DM
2011
14 years 9 months ago
2011
An acyclic vertex coloring of a graph is a proper vertex coloring such that there are no bichromatic cycles. The acyclic chromatic number of G, denoted ...