3211 search results - page 21 / 643 » On the Grundy Number of a Graph |
DM
2008
14 years 11 months ago
2008
The reinforcement number of a graph is the smallest number of edges that have to be added to a graph to reduce the domination number. We introduce the k-reinforcement number of a ...
116
click to vote
JGT
2010
14 years 10 months ago
2010
In 1966 Erd˝os and Hajnal proved that the chromatic number of graphs whose
JSYML
2008
14 years 11 months ago
2008
We show that if add(null) = c, then the globally Baire and universally measurable chromatic numbers of the graph of any Borel function on a Polish space are equal and at most three...
JSYML
2010
14 years 6 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...
DM
2000
14 years 11 months ago
2000
Generalizing a result of Bodendiek and Burosch on graphs it is proved that every vertex-simple