1395 search results - page 150 / 279 » (k, )-Distance-Hereditary Graphs |
182
click to vote
DAM
1999
15 years 6 months ago
1999
The achromatic number (G) of a graph G = (V, E) is the maximum k such that V has a partition V1, V2, . . . , Vk into independent sets, the union of no pair of which is independent...
137
click to vote
JGT
2010
15 years 4 months ago
2010
: A k-fold coloring of a graph is a function that assigns to each vertex a set of k colors, so that the color sets assigned to adjacent Contract grant sponsor: NSFC; Contract grant...
148
click to vote
JGT
2010
15 years 4 months ago
2010
: Let G be a toroidal graph without cycles of a fixed length k, and l(G) the list chromatic number of G. We establish tight upper bounds Contract grant sponsor: RGC; Contract grant...
183
click to vote
ISOLA
2010
Springer
15 years 4 months ago
2010
Springer
We give a detailed construction of a finite-state transition system for a com-connected Message Sequence Graph. Though this result is fairly well-known in the literature there has...
153
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...