Forbidden subgraphs that imply hamiltonian-connectedness

Haitze J. Broersma; Ralph J. Faudree; Andreas Huck; H. Trommel; H.J. Veldman

doi:10.1002/jgt.10034

Forbidden subgraphs that imply hamiltonian-connectedness

Haitze J. Broersma, Ralph J. Faudree, Andreas Huck, H. Trommel, H.J. Veldman

Discrete Mathematics and Mathematical Programming

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

Abstract

It is proven that if G is a 3‐connected claw‐free graph which is also H1‐free (where H1 consists of two disjoint triangles connected by an edge), then G is hamiltonian‐connected. Also, examples will be described that determine a finite family of graphs ${\cal L}$equation image such that if a 3‐connected graph being claw‐free and L‐free implies G is hamiltonian‐connected, then L $\in \cal L$equation image

Original language	English
Pages (from-to)	104-119
Number of pages	16
Journal	Journal of graph theory
Volume	40
Issue number	2
DOIs	https://doi.org/10.1002/jgt.10034
Publication status	Published - 2002

Keywords

Hamiltonian-connected
IR-71892
METIS-206789
Forbidden subgraph
Claw-free graph

Access to Document

10.1002/jgt.10034

Fingerprint Dive into the research topics of 'Forbidden subgraphs that imply hamiltonian-connectedness'. Together they form a unique fingerprint.

Cite this

Broersma, H. J., Faudree, R. J., Huck, A., Trommel, H., & Veldman, H. J. (2002). Forbidden subgraphs that imply hamiltonian-connectedness. Journal of graph theory, 40(2), 104-119. https://doi.org/10.1002/jgt.10034

@article{55f9e31800db4037812c4762f3ba096b,

title = "Forbidden subgraphs that imply hamiltonian-connectedness",

abstract = "It is proven that if G is a 3‐connected claw‐free graph which is also H1‐free (where H1 consists of two disjoint triangles connected by an edge), then G is hamiltonian‐connected. Also, examples will be described that determine a finite family of graphs ${\cal L}$equation image such that if a 3‐connected graph being claw‐free and L‐free implies G is hamiltonian‐connected, then L $\in \cal L$equation image",

keywords = "Hamiltonian-connected, IR-71892, METIS-206789, Forbidden subgraph, Claw-free graph",

author = "Broersma, {Haitze J.} and Faudree, {Ralph J.} and Andreas Huck and H. Trommel and H.J. Veldman",

year = "2002",

doi = "10.1002/jgt.10034",

language = "English",

volume = "40",

pages = "104--119",

journal = "Journal of graph theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "2",

}

TY - JOUR

T1 - Forbidden subgraphs that imply hamiltonian-connectedness

AU - Broersma, Haitze J.

AU - Faudree, Ralph J.

AU - Huck, Andreas

AU - Trommel, H.

AU - Veldman, H.J.

PY - 2002

Y1 - 2002

N2 - It is proven that if G is a 3‐connected claw‐free graph which is also H1‐free (where H1 consists of two disjoint triangles connected by an edge), then G is hamiltonian‐connected. Also, examples will be described that determine a finite family of graphs ${\cal L}$equation image such that if a 3‐connected graph being claw‐free and L‐free implies G is hamiltonian‐connected, then L $\in \cal L$equation image

AB - It is proven that if G is a 3‐connected claw‐free graph which is also H1‐free (where H1 consists of two disjoint triangles connected by an edge), then G is hamiltonian‐connected. Also, examples will be described that determine a finite family of graphs ${\cal L}$equation image such that if a 3‐connected graph being claw‐free and L‐free implies G is hamiltonian‐connected, then L $\in \cal L$equation image

KW - Hamiltonian-connected

KW - IR-71892

KW - METIS-206789

KW - Forbidden subgraph

KW - Claw-free graph

U2 - 10.1002/jgt.10034

DO - 10.1002/jgt.10034

M3 - Article

VL - 40

SP - 104

EP - 119

JO - Journal of graph theory

JF - Journal of graph theory

SN - 0364-9024

IS - 2

ER -