Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph

Bojan Mohar, Petr Skoda. Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph. J. Graph Algorithms Appl., 16(2):225-241, 2012. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.