Degree-3 Planar Graphs as Topological Minors of Wall Graphs in Polynomial Time
Discrete Mathematics
2023-02-23 v3
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.
Cite
@article{arxiv.2302.03461,
title = {Degree-3 Planar Graphs as Topological Minors of Wall Graphs in Polynomial Time},
author = {Antoine Amarilli},
journal= {arXiv preprint arXiv:2302.03461},
year = {2023}
}
Comments
V2: Updated to fix an error in the proof pointed out by Mika\"el Monet. V3: Updated to point out alternative and simpler proof route following https://cstheory.stackexchange.com/a/52489