Degree-3 Planar Graphs as Topological Minors of Wall Graphs in Polynomial Time
arXiv:2302.03461
Abstract
In this note, we give a proof of the fact that we can efficiently find degree-3 planar graphs as topological minors of sufficiently large wall graphs. The result is needed as an intermediate step to fix a proof in my PhD thesis.
V2: Updated to fix an error in the proof pointed out by Mikaël Monet. V3: Updated to point out alternative and simpler proof route following https://cstheory.stackexchange.com/a/52489