The edge condition for independent cycles with chords in bipartite graphs

Yunshu Gao and Xue Wang

Applied Mathematics and Computation, 2020, vol. 377, issue C

Abstract: Let G=(V1,V2;E) be a bipartite graph with 3k≤m=|V1|≤|V2|=n, where k be a positive integer. We prove that if the number of edges of G is at least (4k−2)(n−2)+2m, then G contains k independent chorded cycles.

Keywords: Coverings; Independent cycles; Extremal problems (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320301326
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:377:y:2020:i:c:s0096300320301326

DOI: 10.1016/j.amc.2020.125163

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 ().