3211 search results - page 143 / 643 » On the Grundy Number of a Graph |
177
click to vote
COMBINATORICA
2008
15 years 6 months ago
2008
We give a simple proof for a theorem of Katchalski, Last, and Valtr, asserting that the maximum number of edges in a geometric graph G on n vertices with no pair of parallel edges...
157
click to vote
IPL
2008
15 years 6 months ago
2008
Colouring a graph with its chromatic number of colours is known to be NP-hard. Identifying an algorithm in which descisions are made locally with no information about the graph�...
148
click to vote
ENDM
2007
15 years 6 months ago
2007
In 1977, Wegner conjectured that the chromatic number of the square of every planar graph G with maximum degree ∆ ≥ 8 is at most 3
145
click to vote
SIAMDM
2008
15 years 6 months ago
2008
For a rooted graph G, let EV (G; p) be the expected number of vertices reachable from the root when each edge has an independent probability p of operating successfully. We examine...
177
click to vote
RSA
2000
15 years 6 months ago
2000
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...