Login / Signup
Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph.
Bojan Mohar
Petr Skoda
Published in:
J. Graph Algorithms Appl. (2012)
Keyphrases
</>
planar graphs
computational complexity
least squares