EDGE CONDITION FOR A HAMILTONIAN BIPARTITE GRAPH TO BE BIPANCYCLIC

2003系统科学与复杂性：英文版Mathematics被引 1

摘要

Let G be a bamiltonian, bipartite graph on 2n vertices, where n > 3. It is shown that if e(G) > n(n - 1)/2 + 2 then G contains cycles of every possible even length.This improves a result of Entringer and Schmeichel.

引用本文（GB/T 7714）

HUZhiquan. EDGE CONDITION FOR A HAMILTONIAN BIPARTITE GRAPH TO BE BIPANCYCLIC[J]. 系统科学与复杂性：英文版, 2003.

引文网络

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

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