A note on the shortness coefficient and the hamiltonicity of 4-connected line graphs

Liming Xiong; Roman Kužel

doi:10.1007/s00373-004-0595-7

A note on the shortness coefficient and the hamiltonicity of 4-connected line graphs

Liming Xiong^*
, Roman Kužel

^*此作品的通讯作者

数学学院

Jiangxi Normal University
University of West Bohemia
Charles University

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

摘要

Thomassen proposed a well-known conjecture: every 4-connected line graph is hamiltonian. In this note, we show that Thomassen's conjecture is equivalent to the statement that the shortness coefficient of the class of all 4-connected line graphs is one and the statement that the shortness coefficient of the class of all 4-connected claw-free graphs is one respectively.

源语言	英语
页（从-至）	137-144
页数	8
期刊	Graphs and Combinatorics
卷	21
期	1
DOI	https://doi.org/10.1007/s00373-004-0595-7
出版状态	已出版 - 3月 2005

访问文件

10.1007/s00373-004-0595-7

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{8749c57a266d44239e22fcbb05d7396e,

title = "A note on the shortness coefficient and the hamiltonicity of 4-connected line graphs",

abstract = "Thomassen proposed a well-known conjecture: every 4-connected line graph is hamiltonian. In this note, we show that Thomassen's conjecture is equivalent to the statement that the shortness coefficient of the class of all 4-connected line graphs is one and the statement that the shortness coefficient of the class of all 4-connected claw-free graphs is one respectively.",

keywords = "Dominating cycle conjecture, Essentially edge connected graph, Line graph, Shortness coefficient, Thomassen's conjecture",

author = "Liming Xiong and Roman Ku{\v z}el",

year = "2005",

month = mar,

doi = "10.1007/s00373-004-0595-7",

language = "English",

volume = "21",

pages = "137--144",

journal = "Graphs and Combinatorics",

issn = "0911-0119",

publisher = "Springer Japan",

number = "1",

}

TY - JOUR

T1 - A note on the shortness coefficient and the hamiltonicity of 4-connected line graphs

AU - Xiong, Liming

AU - Kužel, Roman

PY - 2005/3

Y1 - 2005/3

N2 - Thomassen proposed a well-known conjecture: every 4-connected line graph is hamiltonian. In this note, we show that Thomassen's conjecture is equivalent to the statement that the shortness coefficient of the class of all 4-connected line graphs is one and the statement that the shortness coefficient of the class of all 4-connected claw-free graphs is one respectively.

AB - Thomassen proposed a well-known conjecture: every 4-connected line graph is hamiltonian. In this note, we show that Thomassen's conjecture is equivalent to the statement that the shortness coefficient of the class of all 4-connected line graphs is one and the statement that the shortness coefficient of the class of all 4-connected claw-free graphs is one respectively.

KW - Dominating cycle conjecture

KW - Essentially edge connected graph

KW - Line graph

KW - Shortness coefficient

KW - Thomassen's conjecture

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

U2 - 10.1007/s00373-004-0595-7

DO - 10.1007/s00373-004-0595-7

M3 - Article

AN - SCOPUS:17144362854

SN - 0911-0119

VL - 21

SP - 137

EP - 144

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 1

ER -

A note on the shortness coefficient and the hamiltonicity of 4-connected line graphs

摘要

访问文件

其它文件与链接

学术指纹

引用此