Every graph admits an unambiguous bold drawing

János Pach. Every graph admits an unambiguous bold drawing. J. Graph Algorithms Appl., 19(1):299-312, 2015. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: