Every connected, locally connected graph is upper embeddable

Ladislav Nebesky. Every connected, locally connected graph is upper embeddable. Journal of Graph Theory, 5(2):205-207, 1981. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.