On the number of certain Hamilton circuits of a complete graph

DOI10.1007/BF02018468zbMath0243.05108OpenAlexW2067114626MaRDI QIDQ2554341

G. Baroti

Publication date: 1973

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02018468

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Related Items (2)

On the number of paths and cycles for almost all graphs and digraphs ⋮ Negative cycles in complete signed graphs

Cites Work

• On Hamilton-cycles of random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the number of certain Hamilton circuits of a complete graph