Finding the closed partition of a planar graph

DOI10.1007/BF01293266MaRDI QIDQ1322561zbMATH OpenFDO

Authors Vijaya Ramachandran, Honghua Yang

Publication date 5 May 1994

Published in Algorithmica (Search for Journal in Brave)

zbMATH Keywords

directed graphplanar graphprogram verificationdual graphstrongly connected componentsequential algorithmclosed partitioncompact digraph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Partitioning Planar Graphs
• Path partitions of planar graphs
• Note on partitions of planar graphs
• Outerplanar partitions of planar graphs
• On uniquely partitionable planar graphs
• scientific article; zbMATH DE number 4101213
• On cleaving a planar graph
• Partitioning a k-connected graph
• scientific article; zbMATH DE number 4101215
• On partitioning the edges of 1-plane graphs

Cites work

• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 3555903 (Why is no real title available?)
• scientific article; zbMATH DE number 3315017 (Why is no real title available?)
• Computing an st-numbering
• Depth-First Search and Linear Graph Algorithms
• Efficient Planarity Testing
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Verification of multiprocess probabilistic protocols

Cited in

(2)

• Topologically trivial closed walks in directed surface graphs
• scientific article; zbMATH DE number 7559234 (Why is no real title available?)

This page was built for publication: Finding the closed partition of a planar graph

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