Smallest 2-edge-connected graphs without a spanning trail

Zhaohong Niu; Liming Xiong; Shumin Zhang

Smallest 2-edge-connected graphs without a spanning trail

Zhaohong Niu
, Liming Xiong^*
, Shumin Zhang

^*此作品的通讯作者

数学学院

Beijing Institute of Technology
Jiangxi Normal University
Shanxi University
Qinghai Normal University

科研成果: 期刊稿件 › 文章 › 同行评审

4 引用（Scopus）

摘要

In this paper, we prove that if G is a 2-edge-connected simple graph with |V(G)| ≤ 10, then G has a spanning trail with the exception of two graphs. This result also determines the smallest 2edge-connected graphs without a spanning trail. As applications, we get some results concerning the existence of spanning trails and traceability of line graphs under degree-sum conditions. The latter extends a similar theorem in [10]. Our results also correct a flaw of the proof of a result in [10].

源语言	英语
页（从-至）	381-397
页数	17
期刊	Utilitas Mathematica
卷	88
出版状态	已出版 - 7月 2012

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{74b29d898c2e409791b0f68e21e69763,

title = "Smallest 2-edge-connected graphs without a spanning trail",

abstract = "In this paper, we prove that if G is a 2-edge-connected simple graph with |V(G)| ≤ 10, then G has a spanning trail with the exception of two graphs. This result also determines the smallest 2edge-connected graphs without a spanning trail. As applications, we get some results concerning the existence of spanning trails and traceability of line graphs under degree-sum conditions. The latter extends a similar theorem in [10]. Our results also correct a flaw of the proof of a result in [10].",

keywords = "2-edge-connected, Line graph, Spanning trail, Traceable",

author = "Zhaohong Niu and Liming Xiong and Shumin Zhang",

year = "2012",

month = jul,

language = "English",

volume = "88",

pages = "381--397",

journal = "Utilitas Mathematica",

issn = "0315-3681",

publisher = "Utilitas Mathematica Publishing Inc.",

}

TY - JOUR

T1 - Smallest 2-edge-connected graphs without a spanning trail

AU - Niu, Zhaohong

AU - Xiong, Liming

AU - Zhang, Shumin

PY - 2012/7

Y1 - 2012/7

N2 - In this paper, we prove that if G is a 2-edge-connected simple graph with |V(G)| ≤ 10, then G has a spanning trail with the exception of two graphs. This result also determines the smallest 2edge-connected graphs without a spanning trail. As applications, we get some results concerning the existence of spanning trails and traceability of line graphs under degree-sum conditions. The latter extends a similar theorem in [10]. Our results also correct a flaw of the proof of a result in [10].

AB - In this paper, we prove that if G is a 2-edge-connected simple graph with |V(G)| ≤ 10, then G has a spanning trail with the exception of two graphs. This result also determines the smallest 2edge-connected graphs without a spanning trail. As applications, we get some results concerning the existence of spanning trails and traceability of line graphs under degree-sum conditions. The latter extends a similar theorem in [10]. Our results also correct a flaw of the proof of a result in [10].

KW - 2-edge-connected

KW - Line graph

KW - Spanning trail

KW - Traceable

UR - https://www.scopus.com/pages/publications/84864341957

M3 - Article

AN - SCOPUS:84864341957

SN - 0315-3681

VL - 88

SP - 381

EP - 397

JO - Utilitas Mathematica

JF - Utilitas Mathematica

ER -

Smallest 2-edge-connected graphs without a spanning trail

摘要

其它文件与链接

指纹

引用此