• Corpus ID: 239768186

On the chromatic number of a family of odd hole free graphs

  title={On the chromatic number of a family of odd hole free graphs},
  author={Jialei Song and Baogang Xu},
A hole is an induced cycle of length at least 4, and an odd hole is a hole of odd length. A full house is a graph composed by a vertex adjacent to both ends of an edge in K4. Let H be the complement of a cycle on 7 vertices. Chudnovsky et al [6] proved that every (odd hole, K4)-free graph is 4-colorable and is 3-colorable if it does not has H as an induced subgraph. In this paper, we use the proving technique of Chudnovsky et al to generalize this conclusion to (odd hole, full house)-free… 
1 Citations
The chromatic number of (P_5, HVN )-free graphs
Let G be a graph. We use χ ( G ) and ω ( G ) to denote the chromatic number and clique number of G respectively. A P 5 is a path on 5 vertices, and an HV N is a K 4 together with one more vertex


On the structure of (banner, odd hole)‐free graphs
It is proved that (banner, odd hole)-free graphs are perfect-divisible, or does not contain a stable set on three vertices, or contains a homogeneous set.
Even and odd holes in cap-free graphs
This article extends the problem of testing whether G(V, E) contains a hole of a given parity to the case where each edge of G has a label odd or even, and derives a decomposition theorem for graphs that contain no cap as induced subgraph (capfree graphs).
Even-hole-free graphs still have bisimplicial vertices.
A {\em hole} in a graph is an induced subgraph which is a cycle of length at least four. A hole is called {\em even} if it has an even number of vertices. An {\em even-hole-free} graph is a graph
The strong perfect graph theorem
In 1960 Berge came up with the concept of perfect graphs, and in doing so, conjectured some characteristics about them. A perfect graph is a graph in which the chromatic number of every induced
A survey of χ ‐boundedness
If a graph has bounded clique number and sufficiently large chromatic number, what can we say about its induced subgraphs? András Gyárfás made a number of challenging conjectures about this in the
Detecting a Theta or a Prism
This paper gives a polynomial-time algorithm to test whether a graph has an induced subgraph that is either a prism or a theta.
Perfect divisibility and 2‐divisibility
It is proved that if a graph is bull-free and either odd-hole-free or $P_5-free, then it is perfectly divisible.