Sciweavers

74 search results - page 6 / 15
» arscom 2007
Sort
View
ARSCOM
2004
64views more  ARSCOM 2004»
14 years 9 months 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...
ARSCOM
1999
44views more  ARSCOM 1999»
14 years 9 months ago
Bounds on the Total Redundance and Efficiency of a Graph
Wayne Goddard, Ortrud Oellermann, Peter J. Slater,...
ARSCOM
2005
59views more  ARSCOM 2005»
14 years 9 months ago
Simultaneous Avoidance Of Generalized Patterns
In [BabStein] Babson and Steingr
Sergey Kitaev, Toufik Mansour
ARSCOM
2006
202views more  ARSCOM 2006»
14 years 9 months ago
Domination in Planar Graphs with Small Diameter II
MacGillivray and Seyffarth (J. Graph Theory 22 (1996), 213
Michael Dorfling, Wayne Goddard, Michael A. Hennin...
ARSCOM
2004
73views more  ARSCOM 2004»
14 years 9 months 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