首页 / 资料库 / 文献详情

THE MAXIMUM ORIENTABLE GENUS OF A GRAPH

Liu Y

1979Computer Science被引 17

出版方页面 →

摘要

In this paper we develop the new embedding technique, discovered by the author in testing the maximum non.orientable genus of a graph, to obtain two more general theorems about the maximum orientable genus of a graph. These results allow us to unify all the concrete results which have been published up to now.The symbols and the technical terms used in this paper can be found in [1], [7].

引用本文（GB/T 7714）

Liu Y. THE MAXIMUM ORIENTABLE GENUS OF A GRAPH[J]. 未知来源, 1979.

引文网络

参考文献与被引分析加载中…

本站仅收录题录与摘要供学习参考，全文版权归属出版方；如有侵权请联系我们删除。