Euler Paths
An implementation of multigraphs in Maxima and an approach to deciding whether a path in a multigraph is an Euler path or not.
Greedy Edge Colouring of Small Graphs
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.
More on Moore Graphs
An implementation of a filter for Moore graphs in graph6 format in Python using the NetworkX and igraph packages
Chromatic Indices of Small Graphs
Calculating the chromatic index of all graphs on at most nine vertices with ten edges or fewer.
Small Moore Graphs
Finding Moore graphs on at most ten vertices.
Colouring Small Graphs: Update
Reproducing Gordon Royle’s table of chromatic numbers of connected graphs as far as graphs of order eight.
Colouring Small Graphs
Reproducing Royle’s table of chromatic number distributions.
A Chromatic Number Program
A script for computing the chromatic number, based on the Tutte polynomial.
Chromatic Polynomials
Computing chromatic polynomials in Python.
Vertex Colouring by Recursive Removal of Independent Sets of Vertices
An alternative to the greedy algorithm for vertex colouring.
Improved Greedy Colouring of Small Graphs
Improved greedy colouring of small graphs with Culberson’s colouring programs.
Strategies for Greedy Vertex Colouring
Compare greedy strategies for colouring small graphs.
Processing Graph Streams
An introduction to gvpr.
Drawing Coloured Queen Graphs
Drawing coloured queen graphs with Graphviz.
Introduction to Greedy Colouring
Introducing Culberson’s graph colouring programs.
Lombardi Drawings
Introducing the Lombardi Spirograph
Basic Graph Drawing
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.
Plane Drawings of Lobsters
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.