On some intriguing problems in hamiltonian graph theory - a survey

Haitze J. Broersma

doi:10.1016/S0012-365X(01)00325-9

On some intriguing problems in hamiltonian graph theory - a survey

Haitze J. Broersma

Discrete Mathematics and Mathematical Programming

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

28 Citations (Scopus)

344 Downloads (Pure)

Abstract

We survey results and open problems in hamiltonian graph theory centered around three themes: regular graphs, t-tough graphs, and claw-free graphs

Original language	English
Pages (from-to)	47-69
Number of pages	23
Journal	Discrete mathematics
Volume	251
Issue number	1-3
DOIs	https://doi.org/10.1016/S0012-365X(01)00325-9
Publication status	Published - 2002

Keywords

Hamiltonian graph
Hopping lemma
Line graph
Essentially 4-edge-connected
Regular graph
Toughness
METIS-206790
t-Tough graph
IR-74740
Claw-free graph
Closure
Cyclically 4-edge-connected
Cubic graph
Traceable graph

Access to Document

10.1016/S0012-365X(01)00325-9

Broersma02onFinal published version, 157 KB

Cite this

@article{15b09367ac92469f87df55c58a83314f,

title = "On some intriguing problems in hamiltonian graph theory - a survey",

abstract = "We survey results and open problems in hamiltonian graph theory centered around three themes: regular graphs, t-tough graphs, and claw-free graphs",

keywords = "Hamiltonian graph, Hopping lemma, Line graph, Essentially 4-edge-connected, Regular graph, Toughness, METIS-206790, t-Tough graph, IR-74740, Claw-free graph, Closure, Cyclically 4-edge-connected, Cubic graph, Traceable graph",

author = "Broersma, \{Haitze J.\}",

year = "2002",

doi = "10.1016/S0012-365X(01)00325-9",

language = "English",

volume = "251",

pages = "47--69",

journal = "Discrete mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - On some intriguing problems in hamiltonian graph theory - a survey

AU - Broersma, Haitze J.

PY - 2002

Y1 - 2002

N2 - We survey results and open problems in hamiltonian graph theory centered around three themes: regular graphs, t-tough graphs, and claw-free graphs

AB - We survey results and open problems in hamiltonian graph theory centered around three themes: regular graphs, t-tough graphs, and claw-free graphs

KW - Hamiltonian graph

KW - Hopping lemma

KW - Line graph

KW - Essentially 4-edge-connected

KW - Regular graph

KW - Toughness

KW - METIS-206790

KW - t-Tough graph

KW - IR-74740

KW - Claw-free graph

KW - Closure

KW - Cyclically 4-edge-connected

KW - Cubic graph

KW - Traceable graph

U2 - 10.1016/S0012-365X(01)00325-9

DO - 10.1016/S0012-365X(01)00325-9

M3 - Article

SN - 0012-365X

VL - 251

SP - 47

EP - 69

JO - Discrete mathematics

JF - Discrete mathematics

IS - 1-3

ER -

On some intriguing problems in hamiltonian graph theory - a survey

Abstract

Keywords

Access to Document

Fingerprint

Cite this