Planar drawings with few slopes of Halin graphs and nested pseudotrees

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

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

Publication date: 25 March 2022

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

Mathematics Subject Classification ID

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

Cites Work

• Embedding planar graphs in four pages
• Title not available (Why is that?)
• Drawings of planar graphs with few slopes and segments
• Bounded-degree graphs have arbitrarily large geometric thickness
• Bounded-degree graphs can have arbitrarily large slope numbers
• The planar slope number of planar partial 3-trees of bounded degree
• Drawability of Complete Graphs Using a Minimal Slope Set
• Finding Hamiltonian cycles in certain planar graphs
• Computing Radial Drawings on the Minimum Number of Circles
• 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
• Outerplanar graph drawings with few slopes
• Planar and plane slope number of partial 2-trees
• Small point sets for simply-nested planar graphs
• Square-contact representations of partial 2-trees and triconnected simply-nested graphs
• Drawing outer 1-planar graphs with few slopes
• Book embeddings of nonplanar graphs with small faces in few pages

Cited In (3)

• Planar drawings with few slopes of Halin graphs and nested pseudotrees
• Universal slope sets for upward planar drawings
• Drawing partial 2-trees with few slopes

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

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