Finding short cycles in planar graphs using separators

DOI10.1016/0196-6774(86)90029-5MaRDI QIDQ3739145zbMATH OpenOpenAlexFDO

Authors Dana 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) Paths and cycles (05C38) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Short cycles in planar graphs.
• Finding small simple cycle separators for 2-connected planar graphs
• Short and simple cycle separators in planar graphs
• Short and simple cycle separators in planar graphs
• Computing the Girth of a Planar Graph in O(n logn) Time

Cited in

(8)

• scientific article; zbMATH DE number 4135967 (Why is no real title available?)
• On the characteristic polynomial of the power of a path
• Short and simple cycle separators in planar graphs
• Short and simple cycle separators in planar graphs
• Short cycles in planar graphs.
• A more compact visibility representation
• Finding and counting given length cycles
• Finding short cycles in embedded graph in polynomial time

This page was built for publication: Finding short cycles in planar graphs using separators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3739145)