Clustered Planarity: Small Clusters in Eulerian Graphs

DOI10.1007/978-3-540-77537-9_30zbMath1137.68495OpenAlexW205631779MaRDI QIDQ5452233

Jan Kára, Ondřej Suchý, Eva Jelínková, Martin Pergel, Tomáš Vyskočil, Jan Kratochvíl

Publication date: 25 March 2008

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_30

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (5)

Straight-Line Rectangular Drawings of Clustered Graphs ⋮ Relaxing the constraints of clustered planarity ⋮ Clustered Planarity: Clusters with Few Outgoing Edges ⋮ Computing Maximum C-Planar Subgraphs ⋮ Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters

This page was built for publication: Clustered Planarity: Small Clusters in Eulerian Graphs