154 search results - page 1 / 31 » Odd subgraphs and matchings |
DM
2002
13 years 4 months ago
2002
CIAC
2010
Springer
13 years 1 months ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
SIAMDM
2008
13 years 4 months ago
2008
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...
SIAMDM
2008
13 years 4 months ago
2008
JGT
2010
13 years 3 months ago
2010
