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

DOI10.1016/S0195-6698(81)80004-2MaRDI QIDQ1154484zbMATH OpenFDO

Authors I. P. Goulden, David M. Jackson

Publication date 1981

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

Full work available at URL https://doi.org/10.1016/S0195-6698(81)80004-2

zbMATH Keywords

closed Euler trailHamiltonian circuits

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3219337 (Why is no real title available?)
• scientific article; zbMATH DE number 3230025 (Why is no real title available?)
• scientific article; zbMATH DE number 3047763 (Why is no real title available?)
• scientific article; zbMATH DE number 3068971 (Why is no real title available?)
• 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

Cited in

(6)

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

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)