On Eulerian circuits and words with prescribed adjacency patterns

DOI10.1016/0097-3165(75)90068-0zbMath0297.05128OpenAlexW2079048435MaRDI QIDQ1213887

Herbert S. Wilf, Joan P. Hutchinson

Publication date: 1975

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(75)90068-0

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Biomechanical solid mechanics (74L15) Directed graphs (digraphs), tournaments (05C20)

Related Items

Beyond the BEST theorem: fast assessment of Eulerian trails ⋮ Conditional exact tests for Markovianity and reversibility in multiple categorical sequences ⋮ Words with prescribed adjacencies ⋮ The extended Simon Newcomb Problem ⋮ Averages by the sieve method ⋮ A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems ⋮ A Formal Calculus for the Enumerative System of Sequences-II. Applications ⋮ A Formal Calculus for the Enumerative System of Sequences-III. Further Developments

Cites Work

• Reconstruction of protein and nucleic acid sequences: IV. The algebra of free monoids and the fragmentation stratagem
• On Unicursal Paths in a Network of Degree 4
• Normal Recurring Decimals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item