Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The number of cycles in a Hamilton graph

From MaRDI portal
Publication:1336706
Jump to:navigation, search

DOI10.1016/0012-365X(94)90031-0zbMath0810.05049OpenAlexW2061557180MaRDI QIDQ1336706

Yongbing Shi

Publication date: 9 April 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90031-0


zbMATH Keywords

number of cyclesHamilton graph


Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)


Related Items

Triangle-free graphs with the maximum number of cycles ⋮ Cycle-maximal triangle-free graphs ⋮ The maximum number of cycles in a graph with fixed number of edges ⋮ On the maximum number of cycles in a Hamiltonian graph



Cites Work

  • Unnamed Item
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1336706&oldid=13463602"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 14:05.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki