154 search results - page 1 / 31 » Odd subgraphs and matchings |
54
Voted
DM
2002
14 years 10 months ago
2002
100
Voted
CIAC
2010
Springer
14 years 7 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
14 years 11 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
14 years 11 months ago
2008
JGT
2010
14 years 9 months ago
2010
