scientific article; zbMATH DE number 750699

From MaRDI portal

Revision as of 23:16, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4764305

Jump to:navigation, search

zbMath0827.05035MaRDI QIDQ4764305

Martin Knor

Publication date: 27 November 1995

Full work available at URL: https://eudml.org/doc/118739

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

bounds number of cycles Menger's theorem distinguishable cycles \(k\)- connected graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Connectivity (05C40)

Related Items (3)

Proof of Komlós's conjecture on Hamiltonian subsets ⋮ Triangle-free graphs with the maximum number of cycles ⋮ Cycle-maximal triangle-free graphs

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4764305&oldid=19043612"