SIAMDM
2008
13 years 11 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
SIAMDM
2008
13 years 11 months ago
2008
Binary hyper-Kloosterman codes C(r, m) of length (2r - 1)m-1 are a quasi-cyclic
SIAMDM
2008
13 years 11 months ago
2008
In a recent paper, Dur
SIAMDM
2008
13 years 11 months ago
2008
SIAMDM
2008
13 years 11 months ago
2008
We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than thes...
SIAMDM
2008
13 years 11 months ago
2008
SIAMDM
2008
13 years 11 months ago
2008
We first show that for any bipartite graph H with at most five vertices, there exists an on-line competitive algorithm for the class of H-free bipartite graphs. We then analyze th...
SIAMDM
2008
13 years 11 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
SIAMDM
2008
13 years 11 months ago
2008
Let m and b be positive integers and let F be a hypergraph. In an (m, b) Maker-Breaker game F two players, called Maker and Breaker, take turns selecting previously unclaimed vert...
SIAMDM
2008
13 years 11 months ago
2008
A hypergraph pair is a pair (G, H) where G and H are hypergraphs on the same set of vertices. We extend the definitions of hypertree-width [7] and generalised hypertree-width [8] ...