The Stein theorem for loopless 2-connected plane multigraphs
Combinatorics
2023-09-22 v1
Abstract
Stein proved that for each simple plane triangulation H there exists a partitioning of the vertex of H into two subsets each of which induces a forest if and only if the dual H^{*} has a Hamilton cycle. We extend the Stein theorem for graphs in the family of all loopless 2-connected plane multigraphs and we prove some other equivalent results.
Cite
@article{arxiv.2309.11517,
title = {The Stein theorem for loopless 2-connected plane multigraphs},
author = {Jan Florek},
journal= {arXiv preprint arXiv:2309.11517},
year = {2023}
}
Comments
3 pages