On the structure of (banner, odd hole)‐free graphs

  title={On the structure of (banner, odd hole)‐free graphs},
  author={Ch{\'i}nh T. Ho{\`a}ng},
  journal={Journal of Graph Theory},
  pages={395 - 412}
  • C. Hoàng
  • Published 8 October 2015
  • Mathematics
  • Journal of Graph Theory
A hole is a chordless cycle with at least four vertices. A hole is odd if it has an odd number of vertices. A banner is a graph that consists of a hole on four vertices and a single vertex with precisely one neighbor on the hole. We prove that a (banner, odd hole)‐free graph is perfect, or does not contain a stable set on three vertices, or contains a homogeneous set. Using this structure result, we design a polynomial‐time algorithm for recognizing (banner, odd hole)‐free graphs. We also… 
On the chromatic number of a family of odd hole free graphs
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.
Coloring graph classes with no induced fork via perfect divisibility
The structure of some classes of fork-free graphs G is studied in the context of perfect divisibility, where F is a graph on five vertices with a stable set of size three, and it is shown that every G ∈ G satisfies χ(G) ≤ ω(G).
Three-in-a-tree in near linear time
The three-in-a-tree problem is solved in O(mlog2 n) time, leading to improved algorithms for recognizing perfect graphs and detecting thetas, pyramids, beetles, and odd and even holes.
Triangle Packings and Transversals of Some $$K_{4}$$K4-Free Graphs
This paper translates an approximate min-max relation for G into an equivalent one for the clique cover number and the independence number of the triangle graph of G and provides optimalθ-bounding functions for classes related to triangle graphs.
Polynomial $$\chi $$χ-Binding Functions and Forbidden Induced Subgraphs: A Survey
This paper addresses perfect graphs, hereditary graphs satisfying the Vizing bound, graphs having linear χ-binding functions and graphs having non-linear polynomial functions, and graph classes defined in terms of forbidden induced subgraphs.
Homogeneous sets, clique-separators, critical graphs, and optimal $\chi$-binding functions
Given a set $\mathcal{H}$ of graphs, let $f_\mathcal{H}^\star\colon \mathbb{N}_{>0}\to \mathbb{N}_{>0}$ be the optimal $\chi$-binding function of the class of $\mathcal{H}$-free graphs, that is,
Sur quelques invariants classiques et nouveaux des hypergraphes
Dans cette these, nous considerons plusieurs parametres des hypergraphes et nous etudions si les restrictions aux sous-classes des hypergraphes permettent d’obtenir des proprietes combinatoires et
2-divisibility of Some Odd Hole Free Graphs
Let G be a graph. We say that G is 2-divisible if for each induced subgraph H of G , either V ( H ) is a stable set, or V ( H ) can be partitioned into two sets A and B such that ω ( H [ A ]) < ω ( H


On the divisibility of graphs
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
Four classes of perfectly orderable graphs
A graph is called “perfectly orderable” if its vertices can be ordered in such a way that, for each induced subgraph F, a certain “greedy” coloring heuristic delivers an optimal coloring of F. No
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
Induced Subgraphs of Graphs with Large Chromatic Number IX: Rainbow Paths
It is proved that for all nonnegative integers k,s there exists c with the following property: for every vertex-colouring (not necessarily optimal) of G, some induced subgraph of G is an s-vertex path, and all its vertices have different colours.
Recognizing Berge Graphs
This paper gives an algorithm to test if a graph G is Berge, with running time O(|V (G)|9), independent of the recent proof of the strong perfect graph conjecture.
Normal hypergraphs and the perfect graph conjecture
Stable sets in two subclasses of banner-free graphs
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
  • S. Micali, V. Vazirani
  • Computer Science
    21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
  • 1980
An 0(√|V|¿|E|) algorithm for finding a maximum matching in general graphs works in 'phases'.