On the planar split thickness of graphs

From MaRDI portal

DOI10.1007/978-3-662-49529-2_30MaRDI QIDQ6827701zbMATH OpenFDO

Authors David Eppstein, Philipp Kindermann, Stephen G. Kobourov, Giuseppe Liotta, Anna Lubiw, Aude Maignan, Debajyoti Mondal, Hamideh Vosoughpour, Sue Whitesides, S. Wismath

Publication date 3 May 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49529-2_30


Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
















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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=On_the_planar_split_thickness_of_graphs&oldid=56002966"
Powered by MediaWiki