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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.