Clustered planarity testing revisited

zbMATH Open1327.05076MaRDI QIDQ895058FDOQ895058

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

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

clustered planaritygraph planarityHanani-Tutte theoremmatroid intersection algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Linear equations (linear algebraic aspects) (15A06) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Clustered planarity testing revisited
• Towards the Hanani-Tutte theorem for clustered graphs
• Clustered Planarity: Small Clusters in Eulerian Graphs
• Clustered planarity = flat clustered planarity
• Unified Hanani-Tutte theorem

Cites work

• scientific article; zbMATH DE number 1262793 (Why is no real title available?)
• scientific article; zbMATH DE number 1953186 (Why is no real title available?)
• scientific article; zbMATH DE number 1974122 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• A characterization of planar graphs by Trémaux orders
• A generalization of the fast LUP matrix decomposition algorithm and applications
• An algorithmic study of switch graphs
• Bounds for generalized thrackles
• C-Planarity of C-Connected Clustered Graphs
• Clustered planarity testing revisited
• Clustering Cycles into Cycles of Clusters
• Efficient Planarity Testing
• Efficient \(C\)-planarity testing for embedded flat clustered graphs with small faces
• Hanani-Tutte and related results
• Hanani-Tutte, monotone drawings, and level-planarity
• Hierarchical planarity testing algorithms
• Improved Bounds for Matroid Partition and Intersection Algorithms
• Matroid intersection algorithms
• Multiplying matrices faster than coppersmith-winograd
• Planarity for clustered graphs
• Powers of tensors and fast matrix multiplication
• Practical Experience with Hanani-Tutte for Testing c-Planarity
• Removing even crossings
• Removing even crossings on surfaces
• Solving sparse linear equations over finite fields
• Strip planarity testing
• Strong Hanani–Tutte on the Projective Plane
• TRÉMAUX TREES AND PLANARITY
• Toward a theory of crossing numbers
• Toward a theory of planarity: Hanani-Tutte and planarity variants
• Towards the Hanani-Tutte theorem for clustered graphs
• Upward Planarity Testing: A Computational Study
• Which crossing number is it anyway?

Cited in

(16)

• Synchronized Planarity with Applications to Constrained Planarity Problems
• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• Atomic Embeddability, Clustered Planarity, and Thickenability
• Unified Hanani-Tutte theorem
• A direct proof of the strong Hanani-Tutte theorem on the projective plane
• Clustered planarity = flat clustered planarity
• Embeddings of \(k\)-complexes into \(2k\)-manifolds
• Towards the Hanani-Tutte theorem for clustered graphs
• Stability of intersections of graphs in the plane and the van Kampen obstruction
• Clustered planarity testing revisited
• Hanani-Tutte for Radial Planarity II
• Embedding Graphs into Embedded Graphs
• Embedding graphs into embedded graphs
• Hanani--Tutte and Hierarchical Partial Planarity
• Simultaneous Embedding
• Hanani-Tutte for approximating maps of graphs

This page was built for publication: Clustered planarity testing revisited

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