Every graph admits an unambiguous bold drawing

DOI10.1007/978-3-642-25878-7_32MaRDI QIDQ3223967zbMATH OpenOpenAlexFDO

Authors János Pach

Publication date 9 March 2012

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25878-7_32

Mathematics Subject Classification ID

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

• Every graph admits an unambiguous bold drawing
• Bold graph drawings
• Grid drawings of graphs with constant edge-vertex resolution
• scientific article; zbMATH DE number 1696625
• scientific article; zbMATH DE number 3924797

Cites work

• An optimal algorithm for intersecting line segments in the plane
• Applications of random sampling in computational geometry. II
• Bold graph drawings
• Drawing Planar Graphs with Large Vertices and Thick Edges
• DRAWING WITH FAT EDGES
• scientific article; zbMATH DE number 3019031 (Why is no real title available?)

Cited in

(4)

• Most unbreakable murky graphs are bull-free
• Every graph admits an unambiguous bold drawing
• Geometry and generation of a new graph planarity game
• Bold graph drawings

This page was built for publication: Every graph admits an unambiguous bold drawing

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