Planar drawings with few slopes of Halin graphs and nested pseudotrees

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
The planar slope number of planar partial 3-trees of bounded degree
Graph minors. III. Planar tree-width
Planar drawings with few slopes of Halin graphs and nested pseudotrees
Forbidden minors characterization of partial 3-trees
Finding Hamiltonian cycles in certain planar graphs
Embedding planar graphs in four pages
A partial k-arboretum of graphs with bounded treewidth
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
1-bend upward planar slope number of SP-digraphs
Drawings of planar graphs with few slopes and segments
The book thickness of 1-planar graphs is constant
Universal slope sets for 1-bend planar drawings
Outerplanar graph drawings with few slopes
Bounded-degree graphs have arbitrarily large geometric thickness
Bounded-degree graphs can have arbitrarily large slope numbers
Graph Drawings with One Bend and Few Slopes
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
Drawing Subcubic 1-Planar Graphs with Few Bends, Few Slopes, and Large Angles
Computing Radial Drawings on the Minimum Number of Circles
How to Draw a Graph
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
Universal slope sets for upward planar drawings
Book embeddings of \(k\)-framed graphs and \(k\)-map graphs

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 Q6586655)