Identifying CodesA census of identifying codes for small graphs. |

Locating-Dominating CodesA census of locating-dominating codes for small graphs. |

Ramsey NumbersA page on Ramsey numbers. |

PseudosimilarityTwo vertices of a graph are similar if an automorphism of the graph takes one to the other. They are pseudosimilar if their vertex deleted subgraphs are isomorphic. |

Uniquely Pancyclic GraphsPancyclic graphs have cycles of all possible lengths. Uniquely pancyclic graphs have exactly one cycle for each length. |

Isomorphic FactorizationSome preliminary experimental results concerning isomorphic factorizations of complete graphs by trees and trivalent graphs. |

Graphs Without Cycles of Specified LengthsSome examples of graphs with cycles of certain even lengths, motivated by the Erdos-Gyarfas conjecture. |

The Cage ProblemSome smallest known graphs of given degree and girth. |

Pictures of Notable GraphsNot much yet... |

Paley GraphsIndependence/clique numbers for some more Paley graphs. |

Graphs from Chess QueensWays to represent well known graphs on chessboards. |

The Petersen GraphFive pictures of the Petersen graph. |

Degree/Diameter ProblemSome constuctions for the degree/diameter problem. |

The Hoffman-Singleton GraphSome pictures of subgraphs of the Hoffmann-Singleton graph. |

Strongly Regular GraphsStrongly regular graph parameters for which the existence question has not been settled. |

Rectilinear Crossing NumbersSome straight-line drawings of famous graphs with few crossings. |

Asymmetric CodesExamples of, and bounds for, optimal asymmetric codes. |

Combinatorial GeometrySome data concerning a few favorite topics in Combinatorial Geometry. Some of this stuff is very old. |

Vander Waerden NumbersBest known bounds on small Vander Waerden numbers. |