%0 Journal Article %1 journals/jgaa/BiedlD16 %A Biedl, Therese C. %A Derka, Martin %D 2016 %J J. Graph Algorithms Appl. %K dblp %N 2 %P 347-362 %T The (3, 1)-ordering for 4-connected planar triangulations. %U http://dblp.uni-trier.de/db/journals/jgaa/jgaa20.html#BiedlD16 %V 20

@article{journals/jgaa/BiedlD16, added-at = {2016-08-17T00:00:00.000+0200}, author = {Biedl, Therese C. and Derka, Martin}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2883bb6a71417fa0c0a863fb9b6f89bff/dblp}, ee = {http://dx.doi.org/10.7155/jgaa.00396}, interhash = {627d5ac7a4d1b5e1c256910a6be478f8}, intrahash = {883bb6a71417fa0c0a863fb9b6f89bff}, journal = {J. Graph Algorithms Appl.}, keywords = {dblp}, number = 2, pages = {347-362}, timestamp = {2016-08-18T09:32:21.000+0200}, title = {The (3, 1)-ordering for 4-connected planar triangulations.}, url = {http://dblp.uni-trier.de/db/journals/jgaa/jgaa20.html#BiedlD16}, volume = 20, year = 2016 }