Showing 2023Show all
2 papers · 1 filter
math.CO2023
The Stein theorem for loopless 2-connected plane multigraphs
Jan Florek
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^{*}…
math.CO2023
A sufficient condition for cubic 3-connected plane bipartite graphs to be hamiltonian
Jan Florek
Barnette's conjecture asserts that every cubic -connected plane bipartite graph is hamiltonian. Although, in general, the problem is still open, some partial results are known.…