Abstract
We present an algorithm that determines in polytime whether a graph contains an even hole. The algorithm is based on a decomposition theorem for even‐hole‐free graphs obtained in Part I of this work. We also give a polytime algorithm to find an even hole in a graph when one exists. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 238–266, 2002
Cite
CITATION STYLE
APA
Conforti, M., Cornuéjols, G., Kapoor, A., & Vušković, K. (2002). Even‐hole‐free graphs part II: Recognition algorithm. Journal of Graph Theory, 40(4), 238–266. https://doi.org/10.1002/jgt.10045
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free