59 search results - page 1 / 12 » Odd Cycle Packing |
STOC
2010
ACM
14 years 8 months ago
2010
ACM
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...
ISAAC
2009
Springer
14 years 3 months ago
2009
Springer
An induced packing of odd cycles in a graph is a packing such that there is no edge in a graph between any two odd cycles in the packing. We prove that the problem is solvable in t...
JCO
2007
13 years 11 months ago
2007
Let Kn1,n2,...,nm be a complete m-partite graph with partite sets of sizes n1,n2,...,nm. A complete m-partite graph is balanced if each partite set has n vertices. We denote this c...
IPCO
1996
14 years 10 days ago
1996
This paper attempts to provide a better understanding of the facial structure of polyhedra previously investigated separately. It introduces the notion of transitive packing and th...
EJC
2008
13 years 11 months ago
2008
The problem of the r-identifying code of a cycle Cn has been solved totally when n is even. Recently, S. Gravier et al. give the r-identifying code for the cycle Cn with the minim...