Pancyclity when each cycle contains k chords
Work
Year: 2018
Type: article
Abstract: For integers n ≥ k ≥ 2, let c(n, k) be the minimum number of chords that must be added to a cycle of length n so that the resulting graph has the property that for every l ∈ {k, k + 1, . . ., n}, ther... more
Author Vladislav Taranchuk
Institution California State University, Sacramento
Cites: 4
Cited by:
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond