ARSCOM
2004
13 years 11 months ago
2004
We show that several known theorems on graphs and digraphs are equivalent. The list of equivalent theorems include Kotzig's result on graphs with unique 1-factors, a lemma by...
ARSCOM
2004
13 years 11 months ago
2004
We show that every hamiltonian claw-free graph with a vertex x of degree d(x) 7 has a 2-factor consisting of exactly two cycles.
ARSCOM
2004
13 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...
ARSCOM
2004
13 years 11 months ago
2004
ARSCOM
2004
13 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 ...
ARSCOM
2004
13 years 11 months ago
2004
ARSCOM
2004
13 years 11 months ago
2004
A set of points in a Steiner triple system (STS(v)) is said to be independent if no three of these points occur in the same block. In this paper we derive for each k 8 a closed f...
ARSCOM
2004
13 years 11 months ago
2004
ARSCOM
2004
13 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
13 years 11 months ago
2004
The concept of circular chromatic number of graphs was introduced by Vince(1988). In this paper we define circular chromatic number of uniform hypergraphs and study their basic pr...