Clustered planarity testing revisited

zbMath1327.05076MaRDI QIDQ895058

Dömötör Pálvölgyi, Jan Kynčl, Radoslav Fulek, Igor Malinović

Publication date: 26 November 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i4p24

zbMATH Keywords

clustered planarity; graph planarity; Hanani-Tutte theorem; matroid intersection algorithm

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C10: Planar graphs; geometric and topological aspects of graph theory

05B35: Combinatorial aspects of matroids and geometric lattices

15A06: Linear equations (linear algebraic aspects)