76 search results - page 15 / 16 » jct 2008 |
JCT
2008
13 years 5 months ago
2008
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
JCT
2008
13 years 5 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
JCT
2008
13 years 5 months ago
2008
A graph G is k-linked if G has at least 2k vertices, and for every sequence x1, x2, . . . , xk, y1, y2, . . . , yk of distinct vertices, G contains k vertex-disjoint paths P1, P2,...
JCT
2008
13 years 5 months ago
2008
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
JCT
2010
13 years 3 months ago
2010
In 2007 Jedwab and Parker proposed [10] that the natural viewpoint for a Golay complementary sequence is as a projection of a multi-dimensional Golay array. In 2008 Fiedler, Jedwa...