Premium
A canonical representation of trivalent hamiltonian graphs
Author(s) -
Frucht Roberto
Publication year - 1977
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190010111
Subject(s) - notation , mathematics , combinatorics , hamiltonian (control theory) , coxeter group , hamiltonian path , hamiltonian path problem , discrete mathematics , graph , arithmetic , mathematical optimization
A canonical representation of trivalent hamiltonian graphs in the form of “span lists” had been proposed by J. Lederberg. It is here presented in a modified form due to H. S. M. Coxeter and the author, and therefore called “LCF notation.” This notation has the advantage of being more concise than Lederberg's original span lists whenever the graph has a hamiltonian circuit with rotational symmetry. It is also useful as a method for a systematic classification of trivalent hamiltonian graphs and allows one to define for such graphs two interesting properties, called, respectively, “antipalindromic” and “quasiantipalindromic.”.