Intersecting longest paths and longest cycles: A survey
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 dimensio...
Main Authors: | Ayesha Shabbir, Carol T. Zamfirescu, Tudor I. Zamfirescu |
---|---|
Format: | Article |
Language: | English |
Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2013-04-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/19 |
Similar Items
-
On Longest Cycles in Essentially 4-Connected Planar Graphs
by: Fabrici Igor, et al.
Published: (2016-08-01) -
On the longest path in a recursively partitionable graph
by: Julien Bensmail
Published: (2013-01-01) -
Fault-tolerant designs in lattice networks on the Klein bottle
by: Ayesha Shabbir
Published: (2014-10-01) -
A Note on Longest Paths in Circular Arc Graphs
by: Joos Felix
Published: (2015-08-01) -
Large degree vertices in longest cycles of graphs, II
by: Binlong Li, et al.
Published: (2019-10-01)