|
Zapiski Nauchnykh Seminarov POMI, 2018, Volume 475, Pages 93–98
(Mi znsl6686)
|
|
|
|
On spanning trees without vertices of degree 2 in plane triangulations
D. V. Karpovab a St. Petersburg Department of Steklov Mathematical Institute of Russian Academy of Sciences, St. Petersburg, Russia
b St. Petersburg State University, Mathematics and Mechanics Faculty, St. Petersburg, Russia
Abstract:
Let $G$ be a $2$-connected plane graph such that at most one its face is not a triangle. It is proved that $G$ has a spanning tree without vertices of degree $2$.
Key words and phrases:
plane graph, triangulation, spanning tree.
Received: 26.11.2018
Citation:
D. V. Karpov, “On spanning trees without vertices of degree 2 in plane triangulations”, Combinatorics and graph theory. Part X, Zap. Nauchn. Sem. POMI, 475, POMI, St. Petersburg, 2018, 93–98
Linking options:
https://www.mathnet.ru/eng/znsl6686 https://www.mathnet.ru/eng/znsl/v475/p93
|
Statistics & downloads: |
Abstract page: | 88 | Full-text PDF : | 63 | References: | 17 |
|