EdgeIdeals : Table of Contents
EdgeIdeals -- A package for working with the edge ideals of (hyper)graphs
-
-
-
-
-
changeRing -- replaces vertices with variables of a different ring
-
-
-
-
-
-
-
-
-
-
-
coverIdeal -- creates the cover ideal of a (hyper)graph
cycle -- returns a graph cycle
-
deleteEdges -- returns the (hyper)graph with specified edges removed
edgeIdeal -- creates the edge ideal of a (hyper)graph
edges -- gets the edges of a (hyper)graph
-
-
getEdge -- gets the n-th edge in a (hyper)graph
-
-
-
-
Gins -- optional argument for isSCM
Graph -- a class for graphs
graph -- constructor for Graph
hasGoodLeaf -- determines if a HyperGraph contains a good leaf
hasOddHole -- tells whether a graph contains an odd hole
-
-
-
-
-
-
-
-
-
-
-
isChordal -- determines if a graph is chordal
isCM -- determines if a (hyper)graph is Cohen-Macaulay
isConnected -- determines if a (hyper)graph is connected
-
isEdge -- determines if an edge is in a (hyper)graph
isForest -- determines whether a (hyper)graph is a forest
isGoodLeaf -- determines if an edge is a good leaf
isGraph -- determines if a hypergraph is a graph
isLeaf -- determines if an edge (or vertex) is a leaf of a (hyper)graph
-
isPerfect -- determines whether a graph is perfect
isSCM -- determines if a (hyper)graph is sequentially Cohen-Macaulay
-
lineGraph -- returns the line graph of a (hyper)graph
-
neighbors -- returns the neighbors of a vertex or list of vertices
-
-
-
-
-
-
-
-
-
-
-
-
-
TimeLimit -- optional argument for randomHyperGraph
-
vertexCovers -- list the minimal vertex covers of a (hyper)graph
-