A remark on the generation of all Euler trails for an Eulerian graph with 2^n edges
FUJIMURA Sho; SHIRAISHI Shuji
Discrete Mathematics and Theoretical Computer Science DMTCS, 27 Jul. 2022, Refereed
On the number of perfect matchings of line graphs II
FUJIMURA Sho; SHIRAISHI Shuji
Discrete Mathematics and Theoretical Computer Science DMTCS, 10 Jul. 2018, Refereed
On the number of perfect matchings of line graphs
Sho FUJIMURA; Shuji SHIRAISHI
Discrete Mathematics and Theoretical Computer Science DMTCS, 11 Sep. 2017, Refereed
パスカルデジタルアーカイブ
Shuji Shiraishi; Yutaka Wada; Shou Fujimura
Literary and Linguistic Computing, 2002, 17(3):289 - 310, Refereed
ライングラフの最大マッチングについて
Discrete Mathematics, 1998, 179:281〜291, Refereed
ライングラフの最大カットについて
Combinatorics, Probability and Computing, Cambridge University Press, 1998, 7:335〜337, Refereed