2 papers
cs.DS2026
Eulerian-spanning set and coboundary operator: An investigation of maxcut beyond planar graphs
Qiming Fang, Sihong Shao, Yuxuan Wu
Using the concepts of Eulerian-spanning set and coboundary operator, we generalize Hadlock's conversion of the maxcut problem on planar graphs to one on general graphs with non-neg…
math.CO2025
Every 2-connected, cubic, planar graph with faces of size at most 6 is Hamiltonian
Sihong Shao, Yuxuan Wu
We prove that every 2-connected, cubic, planar graph with faces of size at most 6 is Hamiltonian, and show that the 6-face condition is tight. Our results push the connectivity con…