This paper deals with the Circular Pattern Matching Problem (CPM). In CPM, we are interested in pattern matching between the text T and the circular pattern C(P) of a given pattern...
We determine the circular chromatic index of flower snarks, by showing that c(F3) = 7/2, c(F5) = 17/5 and c(Fk) = 10/3 for every odd integer k 7, where Fk denotes the flower snar...
We show that for each ε > 0 and each integer ∆ ≥ 1, there exists a number g such that for any graph G of maximum degree ∆ and girth at least g, the circular chromatic in...
A novel algorithm is introduced to track multiple circular objects present in a video using Helmholtz perception principle. First, segmentation of circular objects in the video fra...