On the planar split thickness of graphs
From MaRDI portal
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Planar graphs; geometric and topological aspects of graph theory (05C10)
This page was built for publication: On the planar split thickness of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6827701)