Finding a shortest cycle in a subspace of the cycle space of a graph

Fugang Chao, Han Ren and Ni Cao

Applied Mathematics and Computation, 2015, vol. 268, issue C, 393-398

Abstract: Thomassen’s 3-path-condition shows that it is relatively easy for one to find a shortest cycle in a collection of cycles beyond a subspace of the cycle space of a connected graph and the real challenge is to find a shortest cycle contained in a given subspace of the cycle space of a graph. In this article we investigate the shorter cycle structures in a given subspace of a graph and find a set of cycles in a given graph containing much information about short cycles. We show that for a large range of subspaces of a graph satisfying a “parity condition”, there exists a polynomial time algorithm to find a shortest cycle in these subspaces. This makes a unified treatment of several famous algorithms. Finally we provide lower bounds of some types of short cycles in embedded graphs.

Keywords: 3-path-condition; BFS tree; Short cycle; Embedded graph (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315008346
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:268:y:2015:i:c:p:393-398

DOI: 10.1016/j.amc.2015.06.053

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().