Estimations for the number of cycles in a graph
From MaRDI portal
Publication:1375625
DOI10.1007/BF02093512zbMath0880.05057MaRDI QIDQ1375625
Publication date: 7 January 1998
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Related Items
Cutting-plane-based algorithms for two branch vertices related spanning tree problems ⋮ Proof of Komlós's conjecture on Hamiltonian subsets ⋮ Triangle-free graphs with the maximum number of cycles ⋮ The ratio of the numbers of odd and even cycles in outerplanar graphs ⋮ Cycle-maximal triangle-free graphs ⋮ On graphs with equal domination and 2-domination numbers ⋮ On the maximum number of cycles in a Hamiltonian graph ⋮ Algebraic criteria for structure identification and behaviour analysis of signed networks
Cites Work
This page was built for publication: Estimations for the number of cycles in a graph