Estimations for the number of cycles in a graph

DOI10.1007/BF02093512zbMath0880.05057MaRDI QIDQ1375625

Lutz Volkmann

Publication date: 7 January 1998

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

zbMATH Keywords

cycleminimum degreeundirected graphHamiltonian graphs

Mathematics Subject Classification ID

Paths and cycles (05C38)

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum number of cycles in the complement of a tree
• Cycles in the complement of a tree
• On Algorithms for Enumerating All Circuits of a Graph

This page was built for publication: Estimations for the number of cycles in a graph