A NetworkX-based implementation of greedy edge-colouring for graphs in graph6 format. Using this implementation we investigate the average case performance on all non-isomorphic, connected simple graphs of at most nine vertices.
An implementation of a filter for Moore graphs in graph6 format in Python using the NetworkX and igraph packages
Computing chromatic polynomials in Python.
An alternative to the greedy algorithm for vertex colouring.
Compare greedy strategies for colouring small graphs.
Introducing the Lombardi Spirograph
Explore the world of graph drawing in Python with NetworkX. Learn how to visualize named graphs like the Petersen graph using spring or shell layouts, and efficiently draw large graphs with numerous nodes and edges.
A caterpillar is a tree such that removal of its endpoints leaves a path graph. A lobster is a tree having the property that the removal of leaves leaves a caterpillar. In this post we show how to use Gephi ( https://gephi.org/) to create plane drawings of large lobster graphs.