hasOddHole -- checks whether a graph has a odd hole

Synopsis

• Usage:

  oddHole = hasOddHole G

• Inputs:
  • G, an instance of the type Graph,
• Outputs:
  • oddHole, a Boolean value, whether the graph has an odd hole

Description

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

i2 : hasOddHole G

o2 = false

See also

• cycleGraph -- Constructs a cycle graph
• isPerfect -- checks whether a graph is perfect
• isChordal -- checks whether a graph is chordal