next
|
previous
|
forward
|
backward
| up |
top
|
index
|
toc
|
Macaulay2 web site
Graphs
(missing documentation) ::
hasOddHole
hasOddHole -- checks whether a graph has a odd hole
Synopsis
Usage:
oddHole = hasOddHole G
Inputs:
G
,
an object of class
Graph
(missing documentation)
Outputs:
oddHole
,
a
Boolean value
, 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
See also
cycleGraph
-- Constructs a cycle graph
isPerfect
-- checks whether a graph is perfect
isChordal
-- checks whether a graph is chordal
Ways to use
hasOddHole
:
hasOddHole(Graph)