Nauty : Index
- addEdges -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways
- addEdges(..., MaxDegree => ...) -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways
- addEdges(..., NoNew3Cycles => ...) -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways
- addEdges(..., NoNew4Cycles => ...) -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways
- addEdges(..., NoNew5Cycles => ...) -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways
- addEdges(..., NoNewOddCycles => ...) -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways
- addEdges(..., NoNewSmallCycles => ...) -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways
- addEdges(Graph) -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways
- addEdges(List) -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways
- addEdges(String) -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways
- areIsomorphic -- determines whether two graphs are isomorphic
- areIsomorphic(Graph,Graph) -- determines whether two graphs are isomorphic
- areIsomorphic(Graph,String) -- determines whether two graphs are isomorphic
- areIsomorphic(String,Graph) -- determines whether two graphs are isomorphic
- areIsomorphic(String,String) -- determines whether two graphs are isomorphic
- buildGraphFilter -- creates the appropriate filter string for use with filterGraphs and countGraphs
- buildGraphFilter(HashTable) -- creates the appropriate filter string for use with filterGraphs and countGraphs
- buildGraphFilter(List) -- creates the appropriate filter string for use with filterGraphs and countGraphs
- Comparison of Graph6 and Sparse6 formats
- countGraphs -- counts the number of graphs in the list with given properties
- countGraphs(List,HashTable) -- counts the number of graphs in the list with given properties
- countGraphs(List,List) -- counts the number of graphs in the list with given properties
- countGraphs(List,String) -- counts the number of graphs in the list with given properties
- Example: Checking for isomorphic graphs
- Example: Generating and filtering graphs
- filterGraphs -- filters (i.e., selects) graphs in a list for given properties
- filterGraphs(List,HashTable) -- filters (i.e., selects) graphs in a list for given properties
- filterGraphs(List,List) -- filters (i.e., selects) graphs in a list for given properties
- filterGraphs(List,String) -- filters (i.e., selects) graphs in a list for given properties
- generateBipartiteGraphs -- generates the bipartite graphs with a given bipartition
- generateBipartiteGraphs(..., Class2Degree2 => ...) -- generates the bipartite graphs with a given bipartition
- generateBipartiteGraphs(..., Class2DistinctNeighborhoods => ...) -- generates the bipartite graphs with a given bipartition
- generateBipartiteGraphs(..., Class2MaxCommonNeighbors => ...) -- generates the bipartite graphs with a given bipartition
- generateBipartiteGraphs(..., MaxDegree => ...) -- generates the bipartite graphs with a given bipartition
- generateBipartiteGraphs(..., MinDegree => ...) -- generates the bipartite graphs with a given bipartition
- generateBipartiteGraphs(..., OnlyConnected => ...) -- generates the bipartite graphs with a given bipartition
- generateBipartiteGraphs(PolynomialRing) -- generates the bipartite graphs with a given bipartition
- generateBipartiteGraphs(PolynomialRing,ZZ) -- generates the bipartite graphs with a given bipartition
- generateBipartiteGraphs(PolynomialRing,ZZ,ZZ) -- generates the bipartite graphs with a given bipartition
- generateBipartiteGraphs(PolynomialRing,ZZ,ZZ,ZZ) -- generates the bipartite graphs with a given bipartition
- generateBipartiteGraphs(ZZ) -- generates the bipartite graphs with a given bipartition
- generateBipartiteGraphs(ZZ,ZZ) -- generates the bipartite graphs with a given bipartition
- generateBipartiteGraphs(ZZ,ZZ,ZZ) -- generates the bipartite graphs with a given bipartition
- generateBipartiteGraphs(ZZ,ZZ,ZZ,ZZ) -- generates the bipartite graphs with a given bipartition
- generateGraphs -- generates the graphs on a given number of vertices
- generateGraphs(..., MaxDegree => ...) -- generates the graphs on a given number of vertices
- generateGraphs(..., MinDegree => ...) -- generates the graphs on a given number of vertices
- generateGraphs(..., Only4CycleFree => ...) -- generates the graphs on a given number of vertices
- generateGraphs(..., OnlyBiconnected => ...) -- generates the graphs on a given number of vertices
- generateGraphs(..., OnlyBipartite => ...) -- generates the graphs on a given number of vertices
- generateGraphs(..., OnlyConnected => ...) -- generates the graphs on a given number of vertices
- generateGraphs(..., OnlyTriangleFree => ...) -- generates the graphs on a given number of vertices
- generateGraphs(PolynomialRing) -- generates the graphs on a given number of vertices
- generateGraphs(PolynomialRing,ZZ) -- generates the graphs on a given number of vertices
- generateGraphs(PolynomialRing,ZZ,ZZ) -- generates the graphs on a given number of vertices
- generateGraphs(ZZ) -- generates the graphs on a given number of vertices
- generateGraphs(ZZ,ZZ) -- generates the graphs on a given number of vertices
- generateGraphs(ZZ,ZZ,ZZ) -- generates the graphs on a given number of vertices
- generateRandomGraphs -- generates random graphs on a given number of vertices
- generateRandomGraphs(..., RandomSeed => ...) -- generates random graphs on a given number of vertices
- generateRandomGraphs(PolynomialRing,ZZ) -- generates random graphs on a given number of vertices
- generateRandomGraphs(PolynomialRing,ZZ,QQ) -- generates random graphs on a given number of vertices
- generateRandomGraphs(PolynomialRing,ZZ,RR) -- generates random graphs on a given number of vertices
- generateRandomGraphs(PolynomialRing,ZZ,ZZ) -- generates random graphs on a given number of vertices
- generateRandomGraphs(ZZ,ZZ) -- generates random graphs on a given number of vertices
- generateRandomGraphs(ZZ,ZZ,QQ) -- generates random graphs on a given number of vertices
- generateRandomGraphs(ZZ,ZZ,RR) -- generates random graphs on a given number of vertices
- generateRandomGraphs(ZZ,ZZ,ZZ) -- generates random graphs on a given number of vertices
- generateRandomRegularGraphs -- generates random regular graphs on a given number of vertices
- generateRandomRegularGraphs(..., RandomSeed => ...) -- generates random regular graphs on a given number of vertices
- generateRandomRegularGraphs(PolynomialRing,ZZ,ZZ) -- generates random regular graphs on a given number of vertices
- generateRandomRegularGraphs(ZZ,ZZ,ZZ) -- generates random regular graphs on a given number of vertices
- Graph == Graph -- determines whether two graphs are isomorphic
- Graph == String -- determines whether two graphs are isomorphic
- graph6ToSparse6 -- converts a Graph6 string to a Sparse6 string
- graph6ToSparse6(String) -- converts a Graph6 string to a Sparse6 string
- graphComplement -- computes the complement of a graph
- graphComplement(..., OnlyIfSmaller => ...) -- computes the complement of a graph
- graphComplement(Graph) -- computes the complement of a graph
- graphComplement(List) -- computes the complement of a graph
- graphComplement(String) -- computes the complement of a graph
- graphToString -- converts a graph to a string in the Graph6 format
- graphToString(Graph) -- converts a graph to a string in the Graph6 format
- graphToString(Ideal) -- converts a graph to a string in the Graph6 format
- graphToString(List,ZZ) -- converts a graph to a string in the Graph6 format
- graphToString(MonomialIdeal) -- converts a graph to a string in the Graph6 format
- graphToString(String) -- converts a graph to a string in the Graph6 format
- isPlanar -- determines if a given graph is planar
- isPlanar(Graph) -- determines if a given graph is planar
- isPlanar(String) -- determines if a given graph is planar
- Nauty -- Interface to nauty
- neighborhoodComplements -- complements the neighborhood for each vertex, individually
- neighborhoodComplements(Graph) -- complements the neighborhood for each vertex, individually
- neighborhoodComplements(List) -- complements the neighborhood for each vertex, individually
- neighborhoodComplements(String) -- complements the neighborhood for each vertex, individually
- newEdges -- replaces disjoint pairs of edges by disjoint pairs of two-chains
- newEdges(Graph,PolynomialRing) -- replaces disjoint pairs of edges by disjoint pairs of two-chains
- newEdges(List) -- replaces disjoint pairs of edges by disjoint pairs of two-chains
- newEdges(String) -- replaces disjoint pairs of edges by disjoint pairs of two-chains
- onlyPlanar -- removes non-planar graphs from a list
- onlyPlanar(List) -- removes non-planar graphs from a list
- onlyPlanar(List,Boolean) -- removes non-planar graphs from a list
- relabelBipartite -- relabels a bipartite graph so all vertices of a given class are contiguous
- relabelBipartite(Graph) -- relabels a bipartite graph so all vertices of a given class are contiguous
- relabelBipartite(List) -- relabels a bipartite graph so all vertices of a given class are contiguous
- relabelBipartite(String) -- relabels a bipartite graph so all vertices of a given class are contiguous
- relabelGraph -- applies a vertex invariant based refinement to a graph
- relabelGraph(Graph) -- applies a vertex invariant based refinement to a graph
- relabelGraph(Graph,ZZ) -- applies a vertex invariant based refinement to a graph
- relabelGraph(Graph,ZZ,ZZ) -- applies a vertex invariant based refinement to a graph
- relabelGraph(List) -- applies a vertex invariant based refinement to a graph
- relabelGraph(List,ZZ) -- applies a vertex invariant based refinement to a graph
- relabelGraph(List,ZZ,ZZ) -- applies a vertex invariant based refinement to a graph
- relabelGraph(String) -- applies a vertex invariant based refinement to a graph
- relabelGraph(String,ZZ) -- applies a vertex invariant based refinement to a graph
- relabelGraph(String,ZZ,ZZ) -- applies a vertex invariant based refinement to a graph
- removeEdges -- creates a list of graphs obtained by removing one edge from the given graph in all possible ways
- removeEdges(..., MinDegree => ...) -- creates a list of graphs obtained by removing one edge from the given graph in all possible ways
- removeEdges(Graph) -- creates a list of graphs obtained by removing one edge from the given graph in all possible ways
- removeEdges(List) -- creates a list of graphs obtained by removing one edge from the given graph in all possible ways
- removeEdges(String) -- creates a list of graphs obtained by removing one edge from the given graph in all possible ways
- removeIsomorphs -- removes all isomorphs from a list of graphs
- removeIsomorphs(List) -- removes all isomorphs from a list of graphs
- sparse6ToGraph6 -- converts a Sparse6 string to a Graph6 string
- sparse6ToGraph6(String) -- converts a Sparse6 string to a Graph6 string
- String == Graph -- determines whether two graphs are isomorphic
- stringToEdgeIdeal -- converts a Sparse6 or Graph6 String to an edge ideal in the given polynomial ring
- stringToEdgeIdeal(String,PolynomialRing) -- converts a Sparse6 or Graph6 String to an edge ideal in the given polynomial ring
- stringToGraph -- converts a Sparse6 or Graph6 String to a Graph in the given polynomial ring
- stringToGraph(String,PolynomialRing) -- converts a Sparse6 or Graph6 String to a Graph in the given polynomial ring