Login / Signup
No optimal 1-planar graph triangulates any nonorientable closed surface.
Taku Nagasawa
Kenta Noguchi
Yusuke Suzuki
Published in:
J. Graph Theory (2018)
Keyphrases
</>
planar graphs
dynamic programming
three dimensional
lower bound
random walk
d objects
linear programming
boundary points