One Hat Cyber Team
Your IP :
216.73.216.115
Server IP :
194.44.31.54
Server :
Linux zen.imath.kiev.ua 4.18.0-553.77.1.el8_10.x86_64 #1 SMP Fri Oct 3 14:30:23 UTC 2025 x86_64
Server Software :
Apache/2.4.37 (Rocky Linux) OpenSSL/1.1.1k
PHP Version :
5.6.40
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
usr
/
share
/
doc
/
Macaulay2
/
Nauty
/
html
/
View File Name :
master.html
<!DOCTYPE html> <html lang="en"> <head> <title>Nauty : Index</title> <meta content="text/html; charset=utf-8" http-equiv="Content-Type"> <link type="text/css" rel="stylesheet" href="../../../../Macaulay2/Style/doc.css"> <link rel="stylesheet" href="../../../../Macaulay2/Style/katex/katex.min.css"> <script defer="defer" src="../../../../Macaulay2/Style/katex/katex.min.js"></script> <script defer="defer" src="../../../../Macaulay2/Style/katex/contrib/auto-render.min.js"></script> <script> var macros = { "\\break": "\\\\", "\\ZZ": "\\mathbb{Z}", "\\NN": "\\mathbb{N}", "\\QQ": "\\mathbb{Q}", "\\RR": "\\mathbb{R}", "\\CC": "\\mathbb{C}", "\\PP": "\\mathbb{P}" }, delimiters = [ { left: "$$", right: "$$", display: true}, { left: "\\[", right: "\\]", display: true}, { left: "$", right: "$", display: false}, { left: "\\(", right: "\\)", display: false} ], ignoredTags = [ "kbd", "var", "samp", "script", "noscript", "style", "textarea", "pre", "code", "option" ]; document.addEventListener("DOMContentLoaded", function() { renderMathInElement(document.body, { delimiters: delimiters, macros: macros, ignoredTags: ignoredTags, trust: true }); }); </script> <style>.katex { font-size: 1em; }</style> <script defer="defer" src="../../../../Macaulay2/Style/katex/contrib/copy-tex.min.js"></script> <script defer="defer" src="../../../../Macaulay2/Style/katex/contrib/render-a11y-string.min.js"></script> <script src="../../../../Macaulay2/Style/prism.js"></script> <script>var current_version = '1.25.06';</script> <script src="../../../../Macaulay2/Style/version-select.js"></script> <link type="image/x-icon" rel="icon" href="../../../../Macaulay2/Style/icon.gif"> </head> <body> <div id="buttons"> <div> <a href="https://macaulay2.com/">Macaulay2</a> <span id="version-select-container"></span> » <a title="Macaulay2 documentation" href="../../Macaulay2Doc/html/index.html">Documentation </a> <br><a href="../../Macaulay2Doc/html/_packages_spprovided_spwith_sp__Macaulay2.html">Packages</a> » <span><a title="Interface to nauty" href="index.html">Nauty</a> :: <a href="master.html">Index</a></span> </div> <div class="right"> <form method="get" action="https://www.google.com/search"> <input placeholder="Search" type="text" name="q" value=""> <input type="hidden" name="q" value="site:macaulay2.com/doc"> </form> next | previous | forward | backward | up | <a href="master.html">index</a> | <a href="toc.html">toc</a> </div> </div> <hr> <h1>Nauty : Index</h1> <div> <a href="#A">A</a> <a href="#B">B</a> <a href="#C">C</a> <a href="#D">D</a> <a href="#E">E</a> <a href="#F">F</a> <a href="#G">G</a> <a href="#H">H</a> <a href="#I">I</a> <a href="#J">J</a> <a href="#K">K</a> <a href="#L">L</a> <a href="#M">M</a> <a href="#N">N</a> <a href="#O">O</a> <a href="#P">P</a> <a href="#Q">Q</a> <a href="#R">R</a> <a href="#S">S</a> <a href="#T">T</a> <a href="#U">U</a> <a href="#V">V</a> <a href="#W">W</a> <a href="#X">X</a> <a href="#Y">Y</a> <a href="#Z">Z</a> </div> <ul> <li><span><a id="A"></a></span><span><a title="creates a list of graphs obtained by adding one new edge to the given graph in all possible ways" href="_add__Edges.html">addEdges</a> -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways</span></li> <li><span><a title="creates a list of graphs obtained by adding one new edge to the given graph in all possible ways" href="_add__Edges.html">addEdges(...,MaxDegree=>...)</a> -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways</span></li> <li><span><a title="creates a list of graphs obtained by adding one new edge to the given graph in all possible ways" href="_add__Edges.html">addEdges(...,NoNew3Cycles=>...)</a> -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways</span></li> <li><span><a title="creates a list of graphs obtained by adding one new edge to the given graph in all possible ways" href="_add__Edges.html">addEdges(...,NoNew4Cycles=>...)</a> -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways</span></li> <li><span><a title="creates a list of graphs obtained by adding one new edge to the given graph in all possible ways" href="_add__Edges.html">addEdges(...,NoNew5Cycles=>...)</a> -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways</span></li> <li><span><a title="creates a list of graphs obtained by adding one new edge to the given graph in all possible ways" href="_add__Edges.html">addEdges(...,NoNewOddCycles=>...)</a> -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways</span></li> <li><span><a title="creates a list of graphs obtained by adding one new edge to the given graph in all possible ways" href="_add__Edges.html">addEdges(...,NoNewSmallCycles=>...)</a> -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways</span></li> <li><span><a title="creates a list of graphs obtained by adding one new edge to the given graph in all possible ways" href="_add__Edges.html">addEdges(Graph)</a> -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways</span></li> <li><span><a title="creates a list of graphs obtained by adding one new edge to the given graph in all possible ways" href="_add__Edges.html">addEdges(List)</a> -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways</span></li> <li><span><a title="creates a list of graphs obtained by adding one new edge to the given graph in all possible ways" href="_add__Edges.html">addEdges(String)</a> -- creates a list of graphs obtained by adding one new edge to the given graph in all possible ways</span></li> <li><span><a title="determines whether two graphs are isomorphic" href="_are__Isomorphic.html">areIsomorphic</a> -- determines whether two graphs are isomorphic</span></li> <li><span><a title="determines whether two graphs are isomorphic" href="_are__Isomorphic.html">areIsomorphic(Graph,Graph)</a> -- determines whether two graphs are isomorphic</span></li> <li><span><a title="determines whether two graphs are isomorphic" href="_are__Isomorphic.html">areIsomorphic(Graph,String)</a> -- determines whether two graphs are isomorphic</span></li> <li><span><a title="determines whether two graphs are isomorphic" href="_are__Isomorphic.html">areIsomorphic(String,Graph)</a> -- determines whether two graphs are isomorphic</span></li> <li><span><a title="determines whether two graphs are isomorphic" href="_are__Isomorphic.html">areIsomorphic(String,String)</a> -- determines whether two graphs are isomorphic</span></li> <li><span><a id="B"></a></span><span><a title="creates the appropriate filter string for use with filterGraphs and countGraphs" href="_build__Graph__Filter.html">buildGraphFilter</a> -- creates the appropriate filter string for use with filterGraphs and countGraphs</span></li> <li><span><a title="creates the appropriate filter string for use with filterGraphs and countGraphs" href="_build__Graph__Filter.html">buildGraphFilter(HashTable)</a> -- creates the appropriate filter string for use with filterGraphs and countGraphs</span></li> <li><span><a title="creates the appropriate filter string for use with filterGraphs and countGraphs" href="_build__Graph__Filter.html">buildGraphFilter(List)</a> -- creates the appropriate filter string for use with filterGraphs and countGraphs</span></li> <li><span><a id="C"></a></span><span><a href="___Comparison_spof_sp__Graph6_spand_sp__Sparse6_spformats.html">Comparison of Graph6 and Sparse6 formats</a></span></li> <li><span><a title="counts the number of graphs in the list with given properties" href="_count__Graphs.html">countGraphs</a> -- counts the number of graphs in the list with given properties</span></li> <li><span><a title="counts the number of graphs in the list with given properties" href="_count__Graphs.html">countGraphs(List,HashTable)</a> -- counts the number of graphs in the list with given properties</span></li> <li><span><a title="counts the number of graphs in the list with given properties" href="_count__Graphs.html">countGraphs(List,List)</a> -- counts the number of graphs in the list with given properties</span></li> <li><span><a title="counts the number of graphs in the list with given properties" href="_count__Graphs.html">countGraphs(List,String)</a> -- counts the number of graphs in the list with given properties</span></li> <li><span><a id="D"></a><a id="E"></a></span><span><a href="___Example_co_sp__Checking_spfor_spisomorphic_spgraphs.html">Example: Checking for isomorphic graphs</a></span></li> <li><span><a href="___Example_co_sp__Generating_spand_spfiltering_spgraphs.html">Example: Generating and filtering graphs</a></span></li> <li><span><a id="F"></a></span><span><a title="filters (i.e., selects) graphs in a list for given properties" href="_filter__Graphs.html">filterGraphs</a> -- filters (i.e., selects) graphs in a list for given properties</span></li> <li><span><a title="filters (i.e., selects) graphs in a list for given properties" href="_filter__Graphs.html">filterGraphs(List,HashTable)</a> -- filters (i.e., selects) graphs in a list for given properties</span></li> <li><span><a title="filters (i.e., selects) graphs in a list for given properties" href="_filter__Graphs.html">filterGraphs(List,List)</a> -- filters (i.e., selects) graphs in a list for given properties</span></li> <li><span><a title="filters (i.e., selects) graphs in a list for given properties" href="_filter__Graphs.html">filterGraphs(List,String)</a> -- filters (i.e., selects) graphs in a list for given properties</span></li> <li><span><a id="G"></a></span><span><a title="generates the bipartite graphs with a given bipartition" href="_generate__Bipartite__Graphs.html">generateBipartiteGraphs</a> -- generates the bipartite graphs with a given bipartition</span></li> <li><span><a title="generates the bipartite graphs with a given bipartition" href="_generate__Bipartite__Graphs.html">generateBipartiteGraphs(...,Class2Degree2=>...)</a> -- generates the bipartite graphs with a given bipartition</span></li> <li><span><a title="generates the bipartite graphs with a given bipartition" href="_generate__Bipartite__Graphs.html">generateBipartiteGraphs(...,Class2DistinctNeighborhoods=>...)</a> -- generates the bipartite graphs with a given bipartition</span></li> <li><span><a title="generates the bipartite graphs with a given bipartition" href="_generate__Bipartite__Graphs.html">generateBipartiteGraphs(...,Class2MaxCommonNeighbors=>...)</a> -- generates the bipartite graphs with a given bipartition</span></li> <li><span><a title="generates the bipartite graphs with a given bipartition" href="_generate__Bipartite__Graphs.html">generateBipartiteGraphs(...,MaxDegree=>...)</a> -- generates the bipartite graphs with a given bipartition</span></li> <li><span><a title="generates the bipartite graphs with a given bipartition" href="_generate__Bipartite__Graphs.html">generateBipartiteGraphs(...,MinDegree=>...)</a> -- generates the bipartite graphs with a given bipartition</span></li> <li><span><a title="generates the bipartite graphs with a given bipartition" href="_generate__Bipartite__Graphs.html">generateBipartiteGraphs(...,OnlyConnected=>...)</a> -- generates the bipartite graphs with a given bipartition</span></li> <li><span><a title="generates the bipartite graphs with a given bipartition" href="_generate__Bipartite__Graphs.html">generateBipartiteGraphs(PolynomialRing)</a> -- generates the bipartite graphs with a given bipartition</span></li> <li><span><a title="generates the bipartite graphs with a given bipartition" href="_generate__Bipartite__Graphs.html">generateBipartiteGraphs(PolynomialRing,ZZ)</a> -- generates the bipartite graphs with a given bipartition</span></li> <li><span><a title="generates the bipartite graphs with a given bipartition" href="_generate__Bipartite__Graphs.html">generateBipartiteGraphs(PolynomialRing,ZZ,ZZ)</a> -- generates the bipartite graphs with a given bipartition</span></li> <li><span><a title="generates the bipartite graphs with a given bipartition" href="_generate__Bipartite__Graphs.html">generateBipartiteGraphs(PolynomialRing,ZZ,ZZ,ZZ)</a> -- generates the bipartite graphs with a given bipartition</span></li> <li><span><a title="generates the bipartite graphs with a given bipartition" href="_generate__Bipartite__Graphs.html">generateBipartiteGraphs(ZZ)</a> -- generates the bipartite graphs with a given bipartition</span></li> <li><span><a title="generates the bipartite graphs with a given bipartition" href="_generate__Bipartite__Graphs.html">generateBipartiteGraphs(ZZ,ZZ)</a> -- generates the bipartite graphs with a given bipartition</span></li> <li><span><a title="generates the bipartite graphs with a given bipartition" href="_generate__Bipartite__Graphs.html">generateBipartiteGraphs(ZZ,ZZ,ZZ)</a> -- generates the bipartite graphs with a given bipartition</span></li> <li><span><a title="generates the bipartite graphs with a given bipartition" href="_generate__Bipartite__Graphs.html">generateBipartiteGraphs(ZZ,ZZ,ZZ,ZZ)</a> -- generates the bipartite graphs with a given bipartition</span></li> <li><span><a title="generates the graphs on a given number of vertices" href="_generate__Graphs.html">generateGraphs</a> -- generates the graphs on a given number of vertices</span></li> <li><span><a title="generates the graphs on a given number of vertices" href="_generate__Graphs.html">generateGraphs(...,MaxDegree=>...)</a> -- generates the graphs on a given number of vertices</span></li> <li><span><a title="generates the graphs on a given number of vertices" href="_generate__Graphs.html">generateGraphs(...,MinDegree=>...)</a> -- generates the graphs on a given number of vertices</span></li> <li><span><a title="generates the graphs on a given number of vertices" href="_generate__Graphs.html">generateGraphs(...,Only4CycleFree=>...)</a> -- generates the graphs on a given number of vertices</span></li> <li><span><a title="generates the graphs on a given number of vertices" href="_generate__Graphs.html">generateGraphs(...,OnlyBiconnected=>...)</a> -- generates the graphs on a given number of vertices</span></li> <li><span><a title="generates the graphs on a given number of vertices" href="_generate__Graphs.html">generateGraphs(...,OnlyBipartite=>...)</a> -- generates the graphs on a given number of vertices</span></li> <li><span><a title="generates the graphs on a given number of vertices" href="_generate__Graphs.html">generateGraphs(...,OnlyConnected=>...)</a> -- generates the graphs on a given number of vertices</span></li> <li><span><a title="generates the graphs on a given number of vertices" href="_generate__Graphs.html">generateGraphs(...,OnlyTriangleFree=>...)</a> -- generates the graphs on a given number of vertices</span></li> <li><span><a title="generates the graphs on a given number of vertices" href="_generate__Graphs.html">generateGraphs(PolynomialRing)</a> -- generates the graphs on a given number of vertices</span></li> <li><span><a title="generates the graphs on a given number of vertices" href="_generate__Graphs.html">generateGraphs(PolynomialRing,ZZ)</a> -- generates the graphs on a given number of vertices</span></li> <li><span><a title="generates the graphs on a given number of vertices" href="_generate__Graphs.html">generateGraphs(PolynomialRing,ZZ,ZZ)</a> -- generates the graphs on a given number of vertices</span></li> <li><span><a title="generates the graphs on a given number of vertices" href="_generate__Graphs.html">generateGraphs(ZZ)</a> -- generates the graphs on a given number of vertices</span></li> <li><span><a title="generates the graphs on a given number of vertices" href="_generate__Graphs.html">generateGraphs(ZZ,ZZ)</a> -- generates the graphs on a given number of vertices</span></li> <li><span><a title="generates the graphs on a given number of vertices" href="_generate__Graphs.html">generateGraphs(ZZ,ZZ,ZZ)</a> -- generates the graphs on a given number of vertices</span></li> <li><span><a title="generates random graphs on a given number of vertices" href="_generate__Random__Graphs.html">generateRandomGraphs</a> -- generates random graphs on a given number of vertices</span></li> <li><span><a title="generates random graphs on a given number of vertices" href="_generate__Random__Graphs.html">generateRandomGraphs(...,RandomSeed=>...)</a> -- generates random graphs on a given number of vertices</span></li> <li><span><a title="generates random graphs on a given number of vertices" href="_generate__Random__Graphs.html">generateRandomGraphs(PolynomialRing,ZZ)</a> -- generates random graphs on a given number of vertices</span></li> <li><span><a title="generates random graphs on a given number of vertices" href="_generate__Random__Graphs.html">generateRandomGraphs(PolynomialRing,ZZ,QQ)</a> -- generates random graphs on a given number of vertices</span></li> <li><span><a title="generates random graphs on a given number of vertices" href="_generate__Random__Graphs.html">generateRandomGraphs(PolynomialRing,ZZ,RR)</a> -- generates random graphs on a given number of vertices</span></li> <li><span><a title="generates random graphs on a given number of vertices" href="_generate__Random__Graphs.html">generateRandomGraphs(PolynomialRing,ZZ,ZZ)</a> -- generates random graphs on a given number of vertices</span></li> <li><span><a title="generates random graphs on a given number of vertices" href="_generate__Random__Graphs.html">generateRandomGraphs(ZZ,ZZ)</a> -- generates random graphs on a given number of vertices</span></li> <li><span><a title="generates random graphs on a given number of vertices" href="_generate__Random__Graphs.html">generateRandomGraphs(ZZ,ZZ,QQ)</a> -- generates random graphs on a given number of vertices</span></li> <li><span><a title="generates random graphs on a given number of vertices" href="_generate__Random__Graphs.html">generateRandomGraphs(ZZ,ZZ,RR)</a> -- generates random graphs on a given number of vertices</span></li> <li><span><a title="generates random graphs on a given number of vertices" href="_generate__Random__Graphs.html">generateRandomGraphs(ZZ,ZZ,ZZ)</a> -- generates random graphs on a given number of vertices</span></li> <li><span><a title="generates random regular graphs on a given number of vertices" href="_generate__Random__Regular__Graphs.html">generateRandomRegularGraphs</a> -- generates random regular graphs on a given number of vertices</span></li> <li><span><a title="generates random regular graphs on a given number of vertices" href="_generate__Random__Regular__Graphs.html">generateRandomRegularGraphs(...,RandomSeed=>...)</a> -- generates random regular graphs on a given number of vertices</span></li> <li><span><a title="generates random regular graphs on a given number of vertices" href="_generate__Random__Regular__Graphs.html">generateRandomRegularGraphs(PolynomialRing,ZZ,ZZ)</a> -- generates random regular graphs on a given number of vertices</span></li> <li><span><a title="generates random regular graphs on a given number of vertices" href="_generate__Random__Regular__Graphs.html">generateRandomRegularGraphs(ZZ,ZZ,ZZ)</a> -- generates random regular graphs on a given number of vertices</span></li> <li><span><a title="determines whether two graphs are isomorphic" href="_are__Isomorphic.html">Graph == Graph</a> -- determines whether two graphs are isomorphic</span></li> <li><span><a title="determines whether two graphs are isomorphic" href="_are__Isomorphic.html">Graph == String</a> -- determines whether two graphs are isomorphic</span></li> <li><span><a title="converts a Graph6 string to a Sparse6 string" href="_graph6__To__Sparse6.html">graph6ToSparse6</a> -- converts a Graph6 string to a Sparse6 string</span></li> <li><span><a title="converts a Graph6 string to a Sparse6 string" href="_graph6__To__Sparse6.html">graph6ToSparse6(String)</a> -- converts a Graph6 string to a Sparse6 string</span></li> <li><span><a title="computes the complement of a graph" href="_graph__Complement.html">graphComplement</a> -- computes the complement of a graph</span></li> <li><span><a title="computes the complement of a graph" href="_graph__Complement.html">graphComplement(...,OnlyIfSmaller=>...)</a> -- computes the complement of a graph</span></li> <li><span><a title="computes the complement of a graph" href="_graph__Complement.html">graphComplement(Graph)</a> -- computes the complement of a graph</span></li> <li><span><a title="computes the complement of a graph" href="_graph__Complement.html">graphComplement(List)</a> -- computes the complement of a graph</span></li> <li><span><a title="computes the complement of a graph" href="_graph__Complement.html">graphComplement(String)</a> -- computes the complement of a graph</span></li> <li><span><a title="converts a graph to a string in the Graph6 format" href="_graph__To__String.html">graphToString</a> -- converts a graph to a string in the Graph6 format</span></li> <li><span><a title="converts a graph to a string in the Graph6 format" href="_graph__To__String.html">graphToString(Graph)</a> -- converts a graph to a string in the Graph6 format</span></li> <li><span><a title="converts a graph to a string in the Graph6 format" href="_graph__To__String.html">graphToString(Ideal)</a> -- converts a graph to a string in the Graph6 format</span></li> <li><span><a title="converts a graph to a string in the Graph6 format" href="_graph__To__String.html">graphToString(List,ZZ)</a> -- converts a graph to a string in the Graph6 format</span></li> <li><span><a title="converts a graph to a string in the Graph6 format" href="_graph__To__String.html">graphToString(MonomialIdeal)</a> -- converts a graph to a string in the Graph6 format</span></li> <li><span><a title="converts a graph to a string in the Graph6 format" href="_graph__To__String.html">graphToString(String)</a> -- converts a graph to a string in the Graph6 format</span></li> <li><span><a id="H"></a><a id="I"></a></span><span><a title="determines if a given graph is planar" href="_is__Planar.html">isPlanar</a> -- determines if a given graph is planar</span></li> <li><span><a title="determines if a given graph is planar" href="_is__Planar.html">isPlanar(Graph)</a> -- determines if a given graph is planar</span></li> <li><span><a title="determines if a given graph is planar" href="_is__Planar.html">isPlanar(String)</a> -- determines if a given graph is planar</span></li> <li><span><a id="J"></a><a id="K"></a><a id="L"></a><a id="M"></a><a id="N"></a></span><span><a title="Interface to nauty" href="index.html">Nauty</a> -- Interface to nauty</span></li> <li><span><a title="complements the neighborhood for each vertex, individually" href="_neighborhood__Complements.html">neighborhoodComplements</a> -- complements the neighborhood for each vertex, individually</span></li> <li><span><a title="complements the neighborhood for each vertex, individually" href="_neighborhood__Complements.html">neighborhoodComplements(Graph)</a> -- complements the neighborhood for each vertex, individually</span></li> <li><span><a title="complements the neighborhood for each vertex, individually" href="_neighborhood__Complements.html">neighborhoodComplements(List)</a> -- complements the neighborhood for each vertex, individually</span></li> <li><span><a title="complements the neighborhood for each vertex, individually" href="_neighborhood__Complements.html">neighborhoodComplements(String)</a> -- complements the neighborhood for each vertex, individually</span></li> <li><span><a title="replaces disjoint pairs of edges by disjoint pairs of two-chains" href="_new__Edges.html">newEdges</a> -- replaces disjoint pairs of edges by disjoint pairs of two-chains</span></li> <li><span><a title="replaces disjoint pairs of edges by disjoint pairs of two-chains" href="_new__Edges.html">newEdges(Graph,PolynomialRing)</a> -- replaces disjoint pairs of edges by disjoint pairs of two-chains</span></li> <li><span><a title="replaces disjoint pairs of edges by disjoint pairs of two-chains" href="_new__Edges.html">newEdges(List)</a> -- replaces disjoint pairs of edges by disjoint pairs of two-chains</span></li> <li><span><a title="replaces disjoint pairs of edges by disjoint pairs of two-chains" href="_new__Edges.html">newEdges(String)</a> -- replaces disjoint pairs of edges by disjoint pairs of two-chains</span></li> <li><span><a id="O"></a></span><span><a title="removes non-planar graphs from a list" href="_only__Planar.html">onlyPlanar</a> -- removes non-planar graphs from a list</span></li> <li><span><a title="removes non-planar graphs from a list" href="_only__Planar.html">onlyPlanar(List)</a> -- removes non-planar graphs from a list</span></li> <li><span><a title="removes non-planar graphs from a list" href="_only__Planar.html">onlyPlanar(List,Boolean)</a> -- removes non-planar graphs from a list</span></li> <li><span><a id="P"></a><a id="Q"></a><a id="R"></a></span><span><a title="relabels a bipartite graph so all vertices of a given class are contiguous" href="_relabel__Bipartite.html">relabelBipartite</a> -- relabels a bipartite graph so all vertices of a given class are contiguous</span></li> <li><span><a title="relabels a bipartite graph so all vertices of a given class are contiguous" href="_relabel__Bipartite.html">relabelBipartite(Graph)</a> -- relabels a bipartite graph so all vertices of a given class are contiguous</span></li> <li><span><a title="relabels a bipartite graph so all vertices of a given class are contiguous" href="_relabel__Bipartite.html">relabelBipartite(List)</a> -- relabels a bipartite graph so all vertices of a given class are contiguous</span></li> <li><span><a title="relabels a bipartite graph so all vertices of a given class are contiguous" href="_relabel__Bipartite.html">relabelBipartite(String)</a> -- relabels a bipartite graph so all vertices of a given class are contiguous</span></li> <li><span><a title="applies a vertex invariant based refinement to a graph" href="_relabel__Graph.html">relabelGraph</a> -- applies a vertex invariant based refinement to a graph</span></li> <li><span><a title="applies a vertex invariant based refinement to a graph" href="_relabel__Graph.html">relabelGraph(Graph)</a> -- applies a vertex invariant based refinement to a graph</span></li> <li><span><a title="applies a vertex invariant based refinement to a graph" href="_relabel__Graph.html">relabelGraph(Graph,ZZ)</a> -- applies a vertex invariant based refinement to a graph</span></li> <li><span><a title="applies a vertex invariant based refinement to a graph" href="_relabel__Graph.html">relabelGraph(Graph,ZZ,ZZ)</a> -- applies a vertex invariant based refinement to a graph</span></li> <li><span><a title="applies a vertex invariant based refinement to a graph" href="_relabel__Graph.html">relabelGraph(List)</a> -- applies a vertex invariant based refinement to a graph</span></li> <li><span><a title="applies a vertex invariant based refinement to a graph" href="_relabel__Graph.html">relabelGraph(List,ZZ)</a> -- applies a vertex invariant based refinement to a graph</span></li> <li><span><a title="applies a vertex invariant based refinement to a graph" href="_relabel__Graph.html">relabelGraph(List,ZZ,ZZ)</a> -- applies a vertex invariant based refinement to a graph</span></li> <li><span><a title="applies a vertex invariant based refinement to a graph" href="_relabel__Graph.html">relabelGraph(String)</a> -- applies a vertex invariant based refinement to a graph</span></li> <li><span><a title="applies a vertex invariant based refinement to a graph" href="_relabel__Graph.html">relabelGraph(String,ZZ)</a> -- applies a vertex invariant based refinement to a graph</span></li> <li><span><a title="applies a vertex invariant based refinement to a graph" href="_relabel__Graph.html">relabelGraph(String,ZZ,ZZ)</a> -- applies a vertex invariant based refinement to a graph</span></li> <li><span><a title="creates a list of graphs obtained by removing one edge from the given graph in all possible ways" href="_remove__Edges.html">removeEdges</a> -- creates a list of graphs obtained by removing one edge from the given graph in all possible ways</span></li> <li><span><a title="creates a list of graphs obtained by removing one edge from the given graph in all possible ways" href="_remove__Edges.html">removeEdges(...,MinDegree=>...)</a> -- creates a list of graphs obtained by removing one edge from the given graph in all possible ways</span></li> <li><span><a title="creates a list of graphs obtained by removing one edge from the given graph in all possible ways" href="_remove__Edges.html">removeEdges(Graph)</a> -- creates a list of graphs obtained by removing one edge from the given graph in all possible ways</span></li> <li><span><a title="creates a list of graphs obtained by removing one edge from the given graph in all possible ways" href="_remove__Edges.html">removeEdges(List)</a> -- creates a list of graphs obtained by removing one edge from the given graph in all possible ways</span></li> <li><span><a title="creates a list of graphs obtained by removing one edge from the given graph in all possible ways" href="_remove__Edges.html">removeEdges(String)</a> -- creates a list of graphs obtained by removing one edge from the given graph in all possible ways</span></li> <li><span><a title="removes all isomorphs from a list of graphs" href="_remove__Isomorphs.html">removeIsomorphs</a> -- removes all isomorphs from a list of graphs</span></li> <li><span><a title="removes all isomorphs from a list of graphs" href="_remove__Isomorphs.html">removeIsomorphs(List)</a> -- removes all isomorphs from a list of graphs</span></li> <li><span><a id="S"></a></span><span><a title="converts a Sparse6 string to a Graph6 string" href="_sparse6__To__Graph6.html">sparse6ToGraph6</a> -- converts a Sparse6 string to a Graph6 string</span></li> <li><span><a title="converts a Sparse6 string to a Graph6 string" href="_sparse6__To__Graph6.html">sparse6ToGraph6(String)</a> -- converts a Sparse6 string to a Graph6 string</span></li> <li><span><a title="determines whether two graphs are isomorphic" href="_are__Isomorphic.html">String == Graph</a> -- determines whether two graphs are isomorphic</span></li> <li><span><a title="converts a Sparse6 or Graph6 String to an edge ideal in the given polynomial ring" href="_string__To__Edge__Ideal.html">stringToEdgeIdeal</a> -- converts a Sparse6 or Graph6 String to an edge ideal in the given polynomial ring</span></li> <li><span><a title="converts a Sparse6 or Graph6 String to an edge ideal in the given polynomial ring" href="_string__To__Edge__Ideal.html">stringToEdgeIdeal(String,PolynomialRing)</a> -- converts a Sparse6 or Graph6 String to an edge ideal in the given polynomial ring</span></li> <li><span><a title="converts a Sparse6 or Graph6 String to a Graph in the given polynomial ring" href="_string__To__Graph.html">stringToGraph</a> -- converts a Sparse6 or Graph6 String to a Graph in the given polynomial ring</span></li> <li><span><a title="converts a Sparse6 or Graph6 String to a Graph in the given polynomial ring" href="_string__To__Graph.html">stringToGraph(String,PolynomialRing)</a> -- converts a Sparse6 or Graph6 String to a Graph in the given polynomial ring</span></li> </ul> <div> <span><a id="T"></a><a id="U"></a><a id="V"></a><a id="W"></a><a id="X"></a><a id="Y"></a><a id="Z"></a></span> </div> </body> </html>