On sufficient degree conditions for traceability of claw-free graphs

Tao  Tian; Hajo Broersma; Liming Xiong

doi:10.1016/j.disc.2020.111883

On sufficient degree conditions for traceability of claw-free graphs

Tao Tian, Hajo Broersma, Liming Xiong

Research output: Contribution to journal › Article › Academic › peer-review

Abstract

We present new results on the traceability of claw-free graphs. In particular, we consider sufficient minimum degree and degree sum conditions that imply that these graphs admit a Hamilton path, unless they have a small order or they belong to well-defined classes of exceptional graphs.

Original language	English
Article number	111883
Journal	Discrete mathematics
Volume	343
Issue number	7
DOIs	https://doi.org/10.1016/j.disc.2020.111883
Publication status	Published - Jul 2020

Keywords

Claw-free graph
Traceable graph
Line graph
Spanning trail
Closure

Access to Document

10.1016/j.disc.2020.111883

Cite this

@article{b4b519f5668b4544b0a3d1d96c3026a0,

title = "On sufficient degree conditions for traceability of claw-free graphs",

abstract = "We present new results on the traceability of claw-free graphs. In particular, we consider sufficient minimum degree and degree sum conditions that imply that these graphs admit a Hamilton path, unless they have a small order or they belong to well-defined classes of exceptional graphs.",

keywords = "Claw-free graph, Traceable graph, Line graph, Spanning trail, Closure",

author = "Tao Tian and Hajo Broersma and Liming Xiong",

year = "2020",

month = jul,

doi = "10.1016/j.disc.2020.111883",

language = "English",

volume = "343",

journal = "Discrete mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "7",

}

TY - JOUR

T1 - On sufficient degree conditions for traceability of claw-free graphs

AU - Tian, Tao

AU - Broersma, Hajo

AU - Xiong, Liming

PY - 2020/7

Y1 - 2020/7

N2 - We present new results on the traceability of claw-free graphs. In particular, we consider sufficient minimum degree and degree sum conditions that imply that these graphs admit a Hamilton path, unless they have a small order or they belong to well-defined classes of exceptional graphs.

AB - We present new results on the traceability of claw-free graphs. In particular, we consider sufficient minimum degree and degree sum conditions that imply that these graphs admit a Hamilton path, unless they have a small order or they belong to well-defined classes of exceptional graphs.

KW - Claw-free graph

KW - Traceable graph

KW - Line graph

KW - Spanning trail

KW - Closure

U2 - 10.1016/j.disc.2020.111883

DO - 10.1016/j.disc.2020.111883

M3 - Article

VL - 343

JO - Discrete mathematics

JF - Discrete mathematics

SN - 0012-365X

IS - 7

M1 - 111883

ER -

On sufficient degree conditions for traceability of claw-free graphs

Abstract

Keywords

Access to Document

Fingerprint

Cite this