Strengthening the closure concept in claw-free graphs

Haitze J. Broersma; Zdenek Ryjacek

doi:10.1016/S0012-365X(00)00226-0

Strengthening the closure concept in claw-free graphs

Haitze J. Broersma, Zdenek Ryjacek

Discrete Mathematics and Mathematical Programming

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

12 Citations (Scopus)

37 Downloads (Pure)

Abstract

We give a strengthening of the closure concept for claw-free graphs introduced by the second author in 1997. The new closure of a claw-free graph G defined here is uniquely determined and preserves the value of the circumference of G. We present an infinite family of graphs with n vertices and 3/2n-1 edges for which the new closure is the complete graph Kn.

Original language	English
Pages (from-to)	55-63
Number of pages	9
Journal	Discrete mathematics
Volume	233
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(00)00226-0
Publication status	Published - 2001

Keywords

METIS-201548
Closure
Claw-free graph
Hamiltonian graph
Circumference
IR-74523
Cycle closure

Access to Document

10.1016/S0012-365X(00)00226-0

Broersma91strength
restricted
Final published version, 104 KB

Fingerprint Dive into the research topics of 'Strengthening the closure concept in claw-free graphs'. Together they form a unique fingerprint.

Cite this

@article{5bc9a99961ff4745a2a1a0598931f23f,

title = "Strengthening the closure concept in claw-free graphs",

abstract = "We give a strengthening of the closure concept for claw-free graphs introduced by the second author in 1997. The new closure of a claw-free graph G defined here is uniquely determined and preserves the value of the circumference of G. We present an infinite family of graphs with n vertices and 3/2n-1 edges for which the new closure is the complete graph Kn.",

keywords = "METIS-201548, Closure, Claw-free graph, Hamiltonian graph, Circumference, IR-74523, Cycle closure",

author = "Broersma, {Haitze J.} and Zdenek Ryjacek",

year = "2001",

doi = "10.1016/S0012-365X(00)00226-0",

language = "English",

volume = "233",

pages = "55--63",

journal = "Discrete mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - Strengthening the closure concept in claw-free graphs

AU - Broersma, Haitze J.

AU - Ryjacek, Zdenek

PY - 2001

Y1 - 2001

N2 - We give a strengthening of the closure concept for claw-free graphs introduced by the second author in 1997. The new closure of a claw-free graph G defined here is uniquely determined and preserves the value of the circumference of G. We present an infinite family of graphs with n vertices and 3/2n-1 edges for which the new closure is the complete graph Kn.

AB - We give a strengthening of the closure concept for claw-free graphs introduced by the second author in 1997. The new closure of a claw-free graph G defined here is uniquely determined and preserves the value of the circumference of G. We present an infinite family of graphs with n vertices and 3/2n-1 edges for which the new closure is the complete graph Kn.

KW - METIS-201548

KW - Closure

KW - Claw-free graph

KW - Hamiltonian graph

KW - Circumference

KW - IR-74523

KW - Cycle closure

U2 - 10.1016/S0012-365X(00)00226-0

DO - 10.1016/S0012-365X(00)00226-0

M3 - Article

VL - 233

SP - 55

EP - 63

JO - Discrete mathematics

JF - Discrete mathematics

SN - 0012-365X

IS - 1-3

ER -