Enumeration of articulation pairs of a planar graph

DOI10.1016/0020-0190(85)90055-9zbMATH Open0585.05006OpenAlexW1969522877MaRDI QIDQ1071024FDOQ1071024

Authors: J.-P. Laumond 

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90055-9

Recommendations

• Isomorphism of planar graphs (working paper)
• Simple enumeration of minimal cutsets separating 2 vertices in a class of undirected planar graphs
• Connectivity of planar graphs
• A square time algorithm for cyclic edge connectivity of planar graphs.
• Connectivity of plane triangulations

zbMATH Keywords

algorithmenumerationconnectivityplanar graphpairs of articulation vertices

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Connectivity (05C40)

Cites Work

• Efficient Planarity Testing
• Dividing a Graph into Triconnected Components
• Title not available (Why is that?)
• Isomorphism of planar graphs (working paper)

Cited In (5)

• Enumeration of chordal planar graphs and maps
• Enumeration of planar constellations with an alternating boundary
• Title not available (Why is that?)
• Connectivity of plane triangulations
• On the enumeration of a class of plane multigraphs

This page was built for publication: Enumeration of articulation pairs of a planar graph

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