3211 search results - page 409 / 643 » On the Grundy Number of a Graph |
151
click to vote
DM
2008
15 years 6 months ago
2008
Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce the notion of uniquely k-determined permutations. We give two criteria f...
141
click to vote
COMBINATORICA
2006
15 years 6 months ago
2006
We prove that the out-distance sequence {f+ (k)} of a vertex-transitive digraph of finite or infinite degree satisfies f+ (k + 1) f+ (k)2 for k 1, where f+ (k) denotes the numbe...
159
click to vote
DAM
2006
15 years 6 months ago
2006
This paper presents an optimal fully dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc ...
169
click to vote
DM
2007
15 years 6 months ago
2007
We study properties of the sets of minimal forbidden minors for the families of graphs having a vertex cover of size at most k. We denote this set by O(k-VERTEX COVER) and call it...
154
click to vote
KI
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. In this paper we present a new symbolic algorithm for the classification, i. e. the calculation of the rewards for both players in case of optimal play, of two-player gam...