SPANNING TRAILS OF GRAPHS

Liu Zhenhong;Jin Guoping

系统科学与复杂性(英文) ›› 1991, Vol. 4 ›› Issue (1) : 55-067.

PDF(605 KB)
PDF(605 KB)
系统科学与复杂性(英文) ›› 1991, Vol. 4 ›› Issue (1) : 55-067.
论文

SPANNING TRAILS OF GRAPHS

    Liu Zhenhong(1);Jin Guoping(2)
作者信息 +

SPANNING TRAILS OF GRAPHS

    Liu Zhenhong(1);Jin Guoping(2)
Author information +
文章历史 +

摘要

Let G be a 2-edge-connected simple graph. We give a sufficient condition in which for any x,y∈V(G), there is an (x,y)-trail which contains every vertex of G(x=y is allowed)except some graphs.

Abstract

Let G be a 2-edge-connected simple graph. We give a sufficient condition in which for any x,y∈V(G), there is an (x,y)-trail which contains every vertex of G(x=y is allowed)except some graphs.

关键词

Spanning trail / dominating circuit / cut ed

Key words

Spanning trail / dominating circuit / cut edge

引用本文

导出引用
Liu Zhenhong , Jin Guoping. SPANNING TRAILS OF GRAPHS. 系统科学与复杂性(英文), 1991, 4(1): 55-067
Liu Zhenhong , Jin Guoping. SPANNING TRAILS OF GRAPHS. Journal of Systems Science and Complexity, 1991, 4(1): 55-067
PDF(605 KB)

106

Accesses

0

Citation

Detail

段落导航
相关文章

/