ArticlesOn the complexity of finding even pairs in planar perfect graphs
References (7)
Even pairs and the strong perfect graph conjecture
Disc. Math.
(1996)Even and odd pairs in line-graphs of bipartite graphs
European Journal of Combinatorics
(1995)On the complexity of testing for odd holes and induced odd paths
Disc. Math.
(1992)
There are more references available in the full text version of this article.
Cited by (4)
Finding induced paths of given parity in claw-free graphs
2012, Algorithmica (New York)Finding an induced path of given parity in planar graphs in polynomial time
2012, Proceedings of the Annual ACM-SIAM Symposium on Discrete AlgorithmsFinding induced paths of given parity in claw-free graphs
2010, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)On planar quasi-parity graphs
2008, SIAM Journal on Discrete Mathematics
- 1
This author is partially supported by CNPq (Conselho Nacional de Pesquisa e Desenvolvimento) - Brazil
Copyright © 2005 Elsevier Ltd. All rights reserved.