Therese C. Biedl. Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs. In R. Ravi, Inge Li Gørtz, editors, Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings. Volume 8503 of Lecture Notes in Computer Science, pages 62-73, Springer, 2014. [doi]
@inproceedings{Biedl14-0, title = {Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs}, author = {Therese C. Biedl}, year = {2014}, doi = {10.1007/978-3-319-08404-6_6}, url = {http://dx.doi.org/10.1007/978-3-319-08404-6_6}, researchr = {https://researchr.org/publication/Biedl14-0}, cites = {0}, citedby = {0}, pages = {62-73}, booktitle = {Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings}, editor = {R. Ravi and Inge Li Gørtz}, volume = {8503}, series = {Lecture Notes in Computer Science}, publisher = {Springer}, isbn = {978-3-319-08403-9}, }