Drawability of Complete Graphs Using a Minimal Slope Set

DOI10.1093/comjnl/37.2.139zbMath1499.68289OpenAlexW2166953080MaRDI QIDQ3549262

Jiang-Hsing Chu, Greg A. Wade

Publication date: 21 December 2008

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/37.2.139

zbMATH Keywords

complete graphsnumber of slopesdocument preparationdrawing of graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (17)

Upward Planar Drawings with Three and More Slopes ⋮ Planar drawings with few slopes of Halin graphs and nested pseudotrees ⋮ Geometric representation of cubic graphs with four directions ⋮ Graph drawings with few slopes ⋮ Upward planar drawings with three and more slopes ⋮ The planar slope number of planar partial 3-trees of bounded degree ⋮ Upward planar drawings with two slopes ⋮ Drawing Planar Graphs with Few Geometric Primitives ⋮ Universal slope sets for 1-bend planar drawings ⋮ Drawing Cubic Graphs with the Four Basic Slopes ⋮ Drawing subcubic planar graphs with four slopes and optimal angular resolution ⋮ 1-bend upward planar slope number of SP-digraphs ⋮ Drawing planar graphs with few segments on a polynomial grid ⋮ Drawing partial 2-trees with few slopes ⋮ Outerplanar graph drawings with few slopes ⋮ Drawing cubic graphs with at most five slopes ⋮ Cubic Graphs Have Bounded Slope Parameter

This page was built for publication: Drawability of Complete Graphs Using a Minimal Slope Set