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

DOI10.1016/S0195-6698(81)80004-2zbMATH Open0465.05050MaRDI QIDQ1154484FDOQ1154484

Authors: I. P. Goulden, David M. Jackson 

Publication date: 1981

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

zbMATH Keywords

Hamiltonian circuitsclosed Euler trail

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On elementary calculus and the Good formula
• Title not available (Why is that?)
• The Generalisation of Tutte's Result for Chromatic Trees, by Lagrangian Methods
• The Application of Lagrangian Methods to the Enumeration of Labelled Trees with Respect to Edge Partition

Cited In (5)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1154484)