1.
Igamberdiev A, Meulemans W, Schulz A. Drawing Planar Cubic 3-Connected Graphs with Few Segments: Algorithms & Experiments. JGAA [Internet]. 2017 Feb. 1 [cited 2024 Jul. 6];21(4):561-88. Available from: http://jgaa-v4.cs.brown.edu/index.php/jgaa/article/view/paper430