EDGE-DISJOINT HAMILTONIAN CYCLES IN GRAPHS

1991中国科学通报：英文版Computer Science被引 1

摘要

All graphs considered here are undirected and finite, without loops or multiple edges. Let δ(G)denote the minimum degree of a graph G. A graph G is called Ore-type-(k)(where k is an integer) if d(u)+d(v)≥|V(G)|+k for every two nonadjacent vertices u and v.

引用本文（GB/T 7714）

李明楚, 刘振宏. EDGE-DISJOINT HAMILTONIAN CYCLES IN GRAPHS[J]. 中国科学通报：英文版, 1991.

引文网络

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

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