The enumeration of directed closed Euler trails and directed Hamiltonian circuits by Lagrangian methods

DOI10.1016/S0195-6698(81)80004-2zbMath0465.05050MaRDI QIDQ1154484

David M. Jackson, Ian P. Goulden

Publication date: 1981

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian circuitsclosed Euler trail

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Enumeration of Hamiltonian Cycles and Paths in a Graph ⋮ A combinatorial proof of the multivariable Lagrange inversion formula ⋮ Hamiltonian cycle enumeration via fermion-zeon convolution ⋮ Inequalities and identities for generalized matrix functions ⋮ Laplacian matrices of graphs: A survey

Cites Work

• On elementary calculus and the Good formula
• The Application of Lagrangian Methods to the Enumeration of Labelled Trees with Respect to Edge Partition
• The Generalisation of Tutte's Result for Chromatic Trees, by Lagrangian Methods
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The enumeration of directed closed Euler trails and directed Hamiltonian circuits by Lagrangian methods