1 citations · 1 across the 6 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.CC2026
Hardness of Forcing Unique Perfect Matchings in Bipartite Graphs of Maximum Degree 3
Ryoma Aoshima, Takashi Horiyama, Atsuki Nagao +4
In a graph , a set of edges is called a \emph{forcing set} if there exists a unique perfect matching such that . Similarly, a set of edges is called a…
math.CO2026
On gapped repeats in a cyclic Fibonacci word
Takashi Horiyama, Yasuhide Numata, Kazuhisa Seto +1
In this article, we consider the words with cyclic indices. For given , we consider the pair of indices such that the word of length from is equal to the word of…