h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area

DOI10.1007/978-3-642-34611-8_12zbMath1341.05173OpenAlexW58939658WikidataQ62042454 ScholiaQ62042454MaRDI QIDQ5200497

Walter Didimo, Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani

Publication date: 6 November 2012

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-34611-8_12

zbMATH Keywords

\(h\)-quasi planarity

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (9)

Area requirement of graph drawings with few crossings per edge ⋮ Topological morphing of planar graphs ⋮ Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs ⋮ 1-bend upward planar slope number of SP-digraphs ⋮ Drawing partial 2-trees with few slopes ⋮ Parameters Tied to Treewidth ⋮ A linear-time algorithm for testing outer-1-planarity ⋮ Quasi-planar Graphs ⋮ Fan-planarity: properties and complexity

This page was built for publication: h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area