Planar drawings with few slopes of Halin graphs and nested pseudotrees

DOI10.1007/978-3-030-83508-8_20OpenAlexW3198523758MaRDI QIDQ832866

Giuseppe Liotta, Fabrizio Montecchiani, Giordano Da Lozzo, Emilio Di Giacomo, Steven Chaplick

Publication date: 25 March 2022

Full work available at URL: https://arxiv.org/abs/2105.08124

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Related Items (2)

Drawing partial 2-trees with few slopes ⋮ Universal slope sets for upward planar drawings

Cites Work

• Unnamed Item
• Unnamed Item
• The planar slope number of planar partial 3-trees of bounded degree
• Finding Hamiltonian cycles in certain planar graphs
• Embedding planar graphs in four pages
• Subexponential-time and FPT algorithms for embedded flat clustered planarity
• Drawing subcubic planar graphs with four slopes and optimal angular resolution
• Small universal point sets for \(k\)-outerplanar graphs
• Drawings of planar graphs with few slopes and segments
• The book thickness of 1-planar graphs is constant
• Outerplanar graph drawings with few slopes
• Bounded-degree graphs have arbitrarily large geometric thickness
• Bounded-degree graphs can have arbitrarily large slope numbers
• Planar and Plane Slope Number of Partial 2-Trees
• Stack and Queue Layouts via Layered Separators
• Small Point Sets for Simply-Nested Planar Graphs
• Drawability of Complete Graphs Using a Minimal Slope Set
• Computing Radial Drawings on the Minimum Number of Circles
• Computing the Girth of a Planar Graph in Linear Time
• Drawing Planar Graphs of Bounded Degree with Few Slopes
• Drawing Outer 1-planar Graphs with Few Slopes
• Book embeddings of nonplanar graphs with small faces in few pages

This page was built for publication: Planar drawings with few slopes of Halin graphs and nested pseudotrees