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}
}
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… 

Figures from this paper

On the chromatic number of a family of odd hole free graphs
TLDR
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
TLDR
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
TLDR
Improved algorithms for detecting or finding induced subgraphs in G, a graph that can be obtained by deleting a set of vertices together with its incident edges, are shown.
Triangulated neighborhoods in even-hole-free graphs
On rank-width of even-hole-free graphs
TLDR
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.
...
...

References

SHOWING 1-10 OF 22 REFERENCES
A Mickey-Mouse Decomposition Theorem
TLDR
A co-NP characterization of graphs signable to be without odd holes if the authors can assign labels “even” or “odd” to its edges in such a way that the number of edges labelled ‘odd’ in every triangle is odd and the number in every chordless cycle of length greater than three is even.
Universally signable graphs
TLDR
A decomposition theorem is given which leads to a good characterization of graphs that are universally signable, which is a generalization of a theorem due to Hajnal and Surányi for triangulated graphs.
On the complexity of testing for odd holes and induced odd paths
Triangle-free graphs that are signable without even holes
TLDR
This work characterize triangle-free graphs for which there exists a subset of edges that intersects every chordless cycle in an odd number of edges (TF odd-signable graphs) and gives a polytime algorithm to test membership in this class.
Alpha-balanced graphs and matrices and GF(3)-representability of matroids
beta-Perfect Graphs
TLDR
It is shown that the greedy algorithm can be used to colour a graph G with no even chordless cycles using at most 2(?(G)?1) colours.
Compositions for perfect graphs
On the perfect graph conjecture
On rigid circuit graphs
...
...