Enumeration of Hamiltonian Cycles and Paths in a Graph

DOI10.2307/2047891zbMath0729.05028OpenAlexW4254028171MaRDI QIDQ3353044

No author found.

Publication date: 1991

Full work available at URL: https://doi.org/10.2307/2047891

zbMATH Keywords

enumerationHamiltonian cyclesHamiltonian pathsspanning trees

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Determinants, permanents, traces, other special matrix functions (15A15) Enumeration in graph theory (05C30) Paths and cycles (05C38) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items

Hamiltonian cycle enumeration via fermion-zeon convolution

Cites Work

• The enumeration of directed closed Euler trails and directed Hamiltonian circuits by Lagrangian methods
• On Operator and Formal Sum Methods for Graph Enumeration Problems
• Matrices with Integer Elements in Combinatorial Investigations
• Unnamed Item
• Unnamed Item