On the maximum number of cycles in outerplanar and series-parallel graphs
From MaRDI portal
Publication:5917852
DOI10.1007/s00373-011-1039-9zbMath1256.05128MaRDI 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
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Cycle-maximal triangle-free graphs, Triangle-free graphs with the maximum number of cycles, The number of labeled outerplanar \(k\)-cyclic graphs, Volume computation for sparse Boolean quadric relaxations
Uses Software
Cites Work