TR-2009-03

Maximum Number of Cycles and Hamiltonian Cycles in Sparse Graphs

Zoltán Király



Abstract

We mainly focus in this paper the maximum number of cycles in the union of two trees. In order to prove non-trivial bounds we also need some upper bounds on the number of Hamiltonian cycles in 3- and 4-regular graphs.


Bibtex entry:

@techreport{egres-09-03,
AUTHOR = {Kir{\'a}ly, Zolt{\'a}n},
TITLE = {Maximum Number of Cycles and Hamiltonian Cycles in Sparse Graphs},
NOTE= {{\tt www.cs.elte.hu/egres}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2009},
NUMBER = {TR-2009-03}
}


Last modification: 9.1.2018. Please email your comments to Tamás Király!