Every graph admits an unambiguous bold drawing

DOI10.7155/JGAA.00359MaRDI QIDQ2941746zbMATH OpenOpenAlexFDO

Authors János Pach

Publication date 25 August 2015

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00359

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Every graph admits an unambiguous bold drawing
• Bold graph drawings
• Grid drawings of graphs with constant edge-vertex resolution
• Characterization of unlabeled radial level planar graphs (extended abstract)
• Computing Radial Drawings on the Minimum Number of Circles

Cited in

(6)

• Limitations on realistic hyperbolic graph drawing
• Grid drawings of graphs with constant edge-vertex resolution
• Most unbreakable murky graphs are bull-free
• Every graph admits an unambiguous bold drawing
• What Can You Draw?
• 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 Q2941746)