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]

@article{Pach15,
  title = {Every graph admits an unambiguous bold drawing},
  author = {János Pach},
  year = {2015},
  doi = {10.7155/jgaa.00359},
  url = {http://dx.doi.org/10.7155/jgaa.00359},
  researchr = {https://researchr.org/publication/Pach15},
  cites = {0},
  citedby = {0},
  journal = {J. Graph Algorithms Appl.},
  volume = {19},
  number = {1},
  pages = {299-312},
}