Sciweavers

Share
13 search results - page 1 / 3
» Induced Packing of Odd Cycles in a Planar Graph
Sort
View
ISAAC
2009
Springer
142views Algorithms» more  ISAAC 2009»
9 years 11 months ago
Induced Packing of Odd Cycles in a Planar Graph
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...
Petr A. Golovach, Marcin Kaminski, Daniël Pau...
STOC
2010
ACM
274views Algorithms» more  STOC 2010»
10 years 4 months ago
Odd Cycle Packing
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...
Ken-ichi Kawarabayashi and Bruce Reed
SIAMDM
2008
101views more  SIAMDM 2008»
9 years 7 months ago
On Planar Quasi-Parity Graphs
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Houga...
Cláudia Linhares Sales, Frédé...
JCO
2007
122views more  JCO 2007»
9 years 7 months ago
Packing 5-cycles into balanced complete m -partite graphs for odd m
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...
Ming-Hway Huang, Chin-Mei Fu, Hung-Lin Fu
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
7 years 9 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
books