EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Sitemap

Organisation

21070 How many conjectures can you stand: a survey

Home Policy Brochure Browse Search User Area Contact Help

Broersma, H.J. and Ryjáček, Z. and Vrána, P. (2012) How many conjectures can you stand: a survey. Graphs and combinatorics, 28 (1). pp. 57-75. ISSN 0911-0119 *** ISI Impact 0,571 ***

Full text available as:

PDF

- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
445 Kb

Official URL: http://dx.doi.org/10.1007/s00373-011-1090-6

Abstract

We survey results and open problems in hamiltonian graph theory centered around two conjectures of the 1980s that are still open: every 4-connected claw-free graph (line graph) is hamiltonian. These conjectures have lead to a wealth of interesting concepts, techniques, results and equivalent conjectures.

Item Type:	Article
Research Group:	EWI-DMMP: Discrete Mathematics and Mathematical Programming, EWI-FMT: Formal Methods and Tools
Research Program:	CTIT-IE&ICT: Industrial Engineering and ICT, CTIT-DSN: Dependable Systems and Networks
Uncontrolled Keywords:	Hamiltonian graph, Hamilton-connected, Claw-free graph, Line graph, Cubic graph, Dominating closed trail, Dominating cycle, Collapsible graph, Supereulerian graph, Snark, Cyclically 4-edge-connected, Essentially 4-edge-connected, Closure, Contractible graph
ID Code:	21070
Status:	Published
Deposited On:	19 January 2012
Refereed:	Yes
International:	Yes
ISI Impact Factor:	0,571
More Information:	statistics

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item