Finding short cycles in planar graphs using separators

DOI10.1016/0196-6774(86)90029-5zbMath0603.05025OpenAlexW2000257871MaRDI QIDQ3739145

D. S. Richards

Publication date: 1986

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(86)90029-5

zbMATH Keywords

algorithmscyclesNP-completenessplanar graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items

A more compact visibility representation, Finding and counting given length cycles, On the characteristic polynomial of the power of a path.