# Graph Theory¶

## Graph objects and methods¶

## Constructors and databases¶

## Low-level implementation¶

## Libraries of algorithms¶

- Graph coloring
- Interface with Cliquer (clique-related problems)
- Centrality
- Asteroidal triples
- Independent sets
- Comparability and permutation graphs
- Line graphs
- Spanning trees
- PQ-Trees
- Generation of trees
- Matching Polynomial
- Genus
- Lovász theta-function of graphs
- Linear Extensions of Directed Acyclic 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
- Vertex separation
- Rank Decompositions of graphs
- Bandwidth of undirected graphs
- Cutwidth
- Products of graphs
- Convexity properties of graphs
- Weakly chordal graphs
- Distances/shortest paths between all pairs of vertices
- LaTeX options for graphs
- Graph editor
- Lists of graphs
- Functions for reading/building graphs/digraphs.
- Hyperbolicity
- Tutte polynomial
- Partial cubes
- Path Enumeration
- GenericGraph Cython functions
- Orientations
- Connectivity related functions