Drawing Cubic Graphs with at Most Five Slopes

DOI10.1007/978-3-540-70904-6_13MaRDI QIDQ3595471zbMATH OpenOpenAlexFDO

Authors Balázs Keszegh, János Pach, Dömötör Pálvölgyi, Géza Tóth

Publication date 28 August 2007

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70904-6_13

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Drawing cubic graphs with at most five slopes
• Drawing subcubic planar graphs with four slopes and optimal angular resolution
• Cubic Graphs Have Bounded Slope Parameter
• Cubic graphs have bounded slope parameter
• Drawing Cubic Graphs with the Four Basic Slopes

Cited in

(7)

• Drawing cubic graphs with at most five slopes
• Drawing Cubic Graphs with the Four Basic Slopes
• Cubic graphs have bounded slope parameter
• Valued Fields withKCommuting Derivations
• The planar slope number of planar partial 3-trees of bounded degree
• Cubic Graphs Have Bounded Slope Parameter
• Geometric representation of cubic graphs with four directions

This page was built for publication: Drawing Cubic Graphs with at Most Five Slopes

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