Sciweavers

13 search results - page 1 / 3
» arscom 2004
Sort
View
61
Voted
ARSCOM
2004
51views more  ARSCOM 2004»
15 years 29 days ago
Enumeration for spanning forests of complete bipartite graphs
Yinglie Jin, Chunlin Liu
93
Voted
ARSCOM
2004
54views more  ARSCOM 2004»
15 years 29 days ago
Orthogonal Designs of Kharaghani Type: II
Christos Koukouvinos, Jennifer Seberry
81
Voted
ARSCOM
2004
64views more  ARSCOM 2004»
15 years 29 days ago
An Upper Bound of 62 on the Classical Ramsey Number R(3, 3, 3, 3)
Susan E. Fettes, Richard L. Kramer, Stanislaw P. R...
92
Voted
ARSCOM
2004
73views more  ARSCOM 2004»
15 years 29 days ago
2-Factors in Hamiltonian Graphs
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.
Florian Pfender
126
Voted
ARSCOM
2004
175views more  ARSCOM 2004»
15 years 29 days ago
Circular Chromatic Number of Hypergraphs
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...
Changiz Eslahchi, Arash Rafiey