Graph Theory¶
Graph objects and methods¶
Constructors and databases¶
- Common graphs
- Common digraphs
- Common graphs and digraphs generators (Cython)
- Graph database
- Database of strongly regular graphs
- Database of distance regular graphs
- Families of graphs derived from classical geometries over finite fields
- Various families of graphs
- Basic graphs
- Chessboard graphs
- Intersection graphs
- 1-skeletons of Platonic solids
- Random graphs
- Various small graphs
- Graphs from the World Map
- ISGCI: Information System on Graph Classes and their Inclusions
Low-level implementation¶
Hypergraphs¶
Libraries of algorithms¶
- Graph coloring
- Interface with Cliquer (clique-related problems)
- Centrality
- Asteroidal triples
- Independent sets
- Cographs
- Comparability and permutation graphs
- Line graphs
- Spanning trees
- PQ-Trees
- Generation of trees
- Matching polynomial
- Genus
- Lovász theta-function of graphs
- Schnyder’s algorithm for straight-line planar embeddings
- Wrapper for Boyer’s (C) planarity algorithm
- Graph traversals
- Graph plotting
- Graph plotting in Javascript with d3.js
- Tree decompositions
- Vertex separation
- Rank Decompositions of graphs
- Bandwidth of undirected graphs
- Cutwidth
- Products of graphs
- Modular Decomposition
- Decomposition by clique minimal separators
- Convexity properties of graphs
- Weakly chordal graphs
- Distances/shortest paths between all pairs of vertices
- LaTeX options for graphs
- Graph editor widget
- Lists of graphs
- Functions for reading/building graphs/digraphs
- Hyperbolicity
- Tutte polynomial
- Partial cubes
- Path enumeration
- GenericGraph Cython functions
- Orientations
- Connectivity related functions
- Edge connectivity
- Domination