Graph of a function | graph | Bipartite graph | planar graph | graph theory | directed graph | Under Graph | random graph | Planar graph | Graph traversal | Graph theory | Graph (mathematics) | Gabriel graph | Cubic crystal system | Cubic centimetre | visibility graph | Unit distance graph | rook's graph | Rado graph | minor (graph theory) | Lattice graph | interval graph | Graph-tool | Graph (data structure) | Graph coloring | graph coloring | Graph | Factor graph | Exponential random graph models | Directed graph |
In combinatorial mathematics, LCF notation or LCF code is a notation devised by Joshua Lederberg, and extended by Coxeter and Frucht, for the representation of cubic graphs that are Hamiltonian.
In 1934, Franklin published a counterexample to the Heawood conjecture, this 12-vertex cubic graph is now known as the Franklin graph.