On spanning trees without vertices of degree 2 in plane triangulations

DOI10.1007/s10958-020-04811-3zbMath1448.05036OpenAlexW3016295297MaRDI QIDQ2202674

Yanyan Li

Publication date: 29 September 2020

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-020-04811-3

zbMATH Keywords

2-connected plane graph

Mathematics Subject Classification ID

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

Cites Work

• Spanning trees in graphs of minimum degree 4 or 5
• Every planar graph is 5-choosable
• A short list color proof of Grötzsch's theorem

This page was built for publication: On spanning trees without vertices of degree 2 in plane triangulations