# Even and odd holes in cap-free graphs

@article{Conforti1999EvenAO,
title={Even and odd holes in cap-free graphs},
author={Michele Conforti and G{\'e}rard Cornu{\'e}jols and Ajai Kapoor and Kristina Vuskovic},
journal={J. Graph Theory},
year={1999},
volume={30},
pages={289-308}
}
• Published 1 April 1999
• Mathematics
• J. Graph Theory
It is an old problem in graph theory to test whether a graph contains a chordless cycle of length greater than three (hole) with a specific parity (even, odd). Studying the structure of graphs without odd holes has obvious implications for Berge's strong perfect graph conjecture that states that a graph G is perfect if and only if neither G nor its complement contain an odd hole. Markossian, Gasparian, and Reed have proven that if neither G nor its complement contain an even hole, then G is…
On the chromatic number of a family of odd hole free graphs
• Mathematics
ArXiv
• 2021
It is proved that for (odd hole, full house)-free graph G, χ(G) ≤ ω(G)+ 1, and the equality holds if and only if ω (G) = 3 and G has H as an induced subgraph.
A note on coloring (even-hole, cap)-free graphs
• Mathematics
ArXiv
• 2015
This paper uses a decomposition theorem by Conforti et al. (1999) to show that if a graph $G$ does not contain any even hole or cap as an induced subgraph, then $\chi(G)$ and $\omega( G)$ are the chromatic number and the clique number of $G$, respectively.
Improved Algorithms for Recognizing Perfect Graphs and Finding Shortest Odd and Even Holes
• Computer Science
ArXiv
• 2022
Improved algorithms for detecting or ﬁnding induced subgraphs in G, a graph that can be obtained by deleting a set of vertices together with its incident edges, are shown.
On rank-width of even-hole-free graphs
• Mathematics
Discret. Math. Theor. Comput. Sci.
• 2017
A class of (diamond, even hole)-free graphs with no clique cutset that has unbounded rank-width is presented, which gives a negative answer and cannot apply Courcelle and Makowsky's meta-theorem which would provide efficient algorithms for a large number of problems, including the maximum independent set problem.