Enumeration by e

DOI10.1007/978-3-319-74325-7_10zbMATH Open1400.05120OpenAlexW2826278071MaRDI QIDQ1624985FDOQ1624985

Authors: Mehdi Hassani 

Publication date: 28 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-74325-7_10

Recommendations

• Enumerating simple paths from connected induced subgraphs
• Path count asymptotics and Stirling numbers
• Asymptotic Enumeration of Eulerian Circuits in the Complete Graph
• On the number of paths and cycles for almost all graphs and digraphs
• scientific article; zbMATH DE number 3952804

zbMATH Keywords

enumerative formulas

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cited In (6)

• Derangements and alternating sum of permutations by integration
• Enumerating simple paths from connected induced subgraphs
• Some results on derangement polynomials
• Reverse search for enumeration
• Enumerations including laconic enumerators
• Enumeration (18th–20th centuries)

This page was built for publication: Enumeration by e

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