Every Graph Admits an Unambiguous Bold Drawing

DOI10.1007/978-3-642-25878-7_32zbMath1311.68123OpenAlexW1870037714MaRDI QIDQ3223967

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 theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Bold graph drawings ⋮ Geometry and Generation of a New Graph Planarity Game

Cites Work

• Unnamed Item
• Bold graph drawings
• Applications of random sampling in computational geometry. II
• An optimal algorithm for intersecting line segments in the plane
• Drawing Planar Graphs with Large Vertices and Thick Edges
• DRAWING WITH FAT EDGES

This page was built for publication: Every Graph Admits an Unambiguous Bold Drawing