Recognizing Polar Planar Graphs Using New Results for Monopolarity
From MaRDI portal
Publication:3104606
DOI10.1007/978-3-642-25591-5_14zbMath1350.68153OpenAlexW195857548MaRDI QIDQ3104606
Publication date: 16 December 2011
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25591-5_14
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Complexity and algorithms for recognizing polar and monopolar graphs ⋮ Algorithms for unipolar and generalized split graphs ⋮ Solving partition problems with colour-bipartitions ⋮ Partitioning a graph into disjoint cliques and a triangle-free graph
This page was built for publication: Recognizing Polar Planar Graphs Using New Results for Monopolarity
