Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs

DOI10.1007/978-3-319-08404-6_6zbMath1417.05026arXiv1312.4101OpenAlexW83209702MaRDI QIDQ3188882

Therese C. Biedl

Publication date: 2 September 2014

Published in: Algorithm Theory – SWAT 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.4101

zbMATH Keywords

spanning treeplanar graphmaximum degreecanonical ordering

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items (2)

Rooted minors and locally spanning subgraphs ⋮ Unnamed Item

This page was built for publication: Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs