Showing math.COShow all
2 papers · 1 filter
math.CO2025
Slack-Pack algorithm for Meir-Moser packing problem
A. D. Kislovskiy, E. Yu. Lerner, I. A. Senkevich
The well-known problem stated by A. Meir and L. Moser consists in tiling the unit square with rectangles (details), whose side lengths equal , where indices~…
math.CO2024
The Heawood approach to Tait colorings and defining vertex sets
E. Yu. Lerner
Given a simple biconnected planar cubic graph, we associate each its vertex among ones with the so-called spin, i.e., a variable which takes on values . P. J. Heawood h…