# hasOddHole -- checks whether a graph has a odd hole

## Synopsis

• Usage:
oddHole = hasOddHole G
• Inputs:
• G, an instance of the type Graph,
• Outputs:
• oddHole, , whether the graph has an odd hole

## Description

A graph has an odd hole if it has an induced cycle that is odd and has length of at least 5.

 i1 : G = graph({{1,2},{2,3},{3,4},{4,5}},EntryMode=>"edges"); i2 : hasOddHole G o2 = false

## Ways to use hasOddHole :

• "hasOddHole(Graph)"

## For the programmer

The object hasOddHole is .