Academic Journals Database
Disseminating quality controlled scientific knowledge

Intersecting longest paths and longest cycles: A survey

ADD TO MY LIST
 
Author(s): Ayesha Shabbir | Carol T. Zamfirescu | Tudor I. Zamfirescu

Journal: Electronic Journal of Graph Theory and Applications
ISSN 2338-2287

Volume: 1;
Issue: 1;
Start page: 56;
Date: 2013;
Original page

ABSTRACT
This is a survey of results obtained during the last 45 years regarding the intersection behaviour of all longest paths, or all longest cycles, in connected graphs. Planar graphs and graphs of higher connectivity receive special attention. Graphs embeddable in the cubic lattice of arbitrary dimension, and graphs embeddable in the triangular or hexagonal lattice of the plane are also discussed.Results concerning the case when not all, but just some longest paths or cycles are intersected, for example two or three of them, are also reported.
RPA Switzerland

Robotic Process Automation Switzerland

    

Tango Rapperswil
Tango Rapperswil