Planar graph algorithms constitute a pivotal area in theoretical computer science, addressing problems where graphs can be drawn on a plane without edge crossings. Among the myriad challenges in this ...

https://doi.org/10.4169/college.math.j.47.1.67 • https://www.jstor.org/stable/10.4169/college.math.j.47.1.67 Copy URL ...

Two computer scientists found — in the unlikeliest of places — just the idea they needed to make a big leap in graph theory. This past October, as Jacob Holm and Eva Rotenberg were thumbing through a ...

This is a preview. Log in through your library . Abstract The term "minimal nonplanar subgraph" of a graph G refers to a nonplanar subgraph N of G having the property that each proper subgraph of N is ...

Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the ...