On the maximum number of cycles in outerplanar and series-parallel graphs
From MaRDI portal
Publication:5917852
DOI10.1007/s00373-011-1039-9zbMath1256.05128OpenAlexW2179830922MaRDI QIDQ5917852
Publication date: 27 December 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-011-1039-9
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
The number of labeled outerplanar \(k\)-cyclic graphs ⋮ Triangle-free graphs with the maximum number of cycles ⋮ Cycle-maximal triangle-free graphs ⋮ Growth of bilinear maps ⋮ Volume computation for sparse Boolean quadric relaxations ⋮ Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph
Uses Software
Cites Work
This page was built for publication: On the maximum number of cycles in outerplanar and series-parallel graphs