zbMath0827.05035MaRDI QIDQ4764305
Martin Knor
Publication date: 27 November 1995
Full work available at URL: https://eudml.org/doc/118739
zbMATH Keywords
bounds; number of cycles; Menger's theorem; distinguishable cycles; \(k\)- connected graphs
Mathematics Subject Classification ID
05C30: Enumeration in graph theory
05C38: Paths and cycles
05C40: Connectivity
Related Items