Sciweavers

59 search results - page 4 / 12
» Odd Cycle Packing
Sort
View
CORR
2011
Springer
138views Education» more  CORR 2011»
13 years 2 months ago
On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs
Let k = (k1, . . . , kn) be a sequence of n integers. For an increasing monotone graph property P we say that a base graph G = ([n], E) is k-resilient with respect to P if for eve...
Sonny Ben-Shimon, Michael Krivelevich, Benny Sudak...
COCOON
2005
Springer
14 years 15 days ago
On Packing and Coloring Hyperedges in a Cycle
Jianping Li, Kang Li, Ken C. K. Law, Hao Zhao
DM
2010
103views more  DM 2010»
13 years 7 months ago
Packing disjoint cycles over vertex cuts
Jochen Harant, Dieter Rautenbach, Peter Recht, Ing...
JCT
2002
44views more  JCT 2002»
13 years 6 months ago
Packing Cycles in Graphs
Guoli Ding, Wenan Zang
ALGORITHMICA
2011
13 years 2 months ago
Approximability of Packing Disjoint Cycles
Zachary Friggstad, Mohammad R. Salavatipour