74 search results - page 9 / 15 » arscom 2007 |
ARSCOM
2000
14 years 11 months ago
2000
The minimum number of incomplete blocks required to cover, exactly times, all t-element subsets from a set V of cardinality v (v > t) is denoted
ARSCOM
2006
14 years 11 months ago
2006
Abstract. There are several well-known and important hamiltonian results for claw-free graphs but only a few are concerned with quasi-claw-free graphs. In this note, we provide a n...
ARSCOM
2004
14 years 11 months ago
2004
The existence question for the family of 4-(15, 5, ) designs has long been answered for all values of except = 2. Here, we resolve this last undecided case and prove that 4-(15, ...
ARSCOM
2004
14 years 11 months ago
2004
We first prove that for any fixed k a cubic graph with few short cycles contains a Kk-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this the...
103
click to vote
ARSCOM
2004
14 years 11 months ago
2004
All cubic partial cubes (i.e., cubic isometric subgraphs of hypercubes) up to 30 vertices and all edge-critical partial cubes up to 14 vertices are presented. The lists of graphs ...