scientific article; zbMATH DE number 4101215

MaRDI QIDQ3826577zbMATH OpenFDO

Authors Shankar M. Venkatesan

Publication date 1989

zbMATH Keywords

boundsplanar graphvertex removal

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35)

Recommendations

• Partitioning Planar Graphs
• Note on partitions of planar graphs
• On partitioning the edges of 1-plane graphs
• On uniquely partitionable planar graphs
• scientific article; zbMATH DE number 4101213
• scientific article; zbMATH DE number 1926663
• Partitioning planar graphs with costs and weights
• Partitioning planar graphs with vertex costs: Algorithms and applications
• Path partitions of planar graphs
• scientific article; zbMATH DE number 1472157

Cited in

(2)

• Finding the closed partition of a planar graph
• On alliance partitions and bisection width for planar graphs

This page was built for publication:

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