Extra connectivity of Kronecker products of some graphs and complete graphs
Guo, Litao; Lin, Fenggen
J. Comb. Math. Comb. Comput. 105, 3-10 (2018).
On z-cycle factorizations with two associate classes where z is even and a is 0 or 1modz
Tiemeyer, M. A.
J. Comb. Math. Comb. Comput. 105, 11-19 (2018).
The number of perfect matchings in random polyazulenoid chains
Wei, Shouliu; Shiu, Wai Chee
J. Comb. Math. Comb. Comput. 105, 21-33 (2018).
Ramsey functions for sequences with restricted gaps
Chokshi, Kajal; Clifton, Alexander; Landman, Bruce; Sawin, Oliver
J. Comb. Math. Comb. Comput. 105, 35-44 (2018).
The minimum rank problem for a linear directed 2-tree
Mou, Gu-Fang
J. Comb. Math. Comb. Comput. 105, 45-54 (2018).
3-connected graphs and their degree sequences
McLaughlin, Jonathan
J. Comb. Math. Comb. Comput. 105, 55-66 (2018).
Splitting balanced incomplete block designs with block size 2×5
Liang, Miao
J. Comb. Math. Comb. Comput. 105, 67-76 (2018).
Factorization numbers of finite rank 3 abelian p-groups
Tărnăuceanu, Marius
J. Comb. Math. Comb. Comput. 105, 77-80 (2018).
Bounds for proper k-connectivity of complete bipartite graphs
Laforge, Elliot; Zhang, Ping
J. Comb. Math. Comb. Comput. 105, 81-92 (2018).
Construction of optimal codes with fixed parameters in projective space
Gao, You; Zhao, Liyun
J. Comb. Math. Comb. Comput. 105, 93-103 (2018).
Signed total Roman k-domination in graphs
Volkmann, Lutz
J. Comb. Math. Comb. Comput. 105, 105-116 (2018).
Some new results on the curling number of graphs
Sudev, N. K.; Susanth, C.; Chithra, K. P.; Kok, Johan; Kalayathankal, Sunny Joseph
J. Comb. Math. Comb. Comput. 105, 117-130 (2018).
Construction of authentication codes with distrust arbitration from unitary geometry
Chen, Shangdi; Tian, Wenjing
J. Comb. Math. Comb. Comput. 105, 131-145 (2018).
A new measure of graph connectivity
Balof, Barry; Guichard, David R.
J. Comb. Math. Comb. Comput. 105, 147-164 (2018).
The unique response Roman domination in trees
Zhao, Ning; Li, WanKai; Zhao, Taiyin; Zhang, Zhiqiang
J. Comb. Math. Comb. Comput. 105, 165-183 (2018).
The four-way intersection problem for Latin squares
Adams, P.; Mahmoodian, E. S.; Minooei, H.; Mohammadi Nevisi, M.
J. Comb. Math. Comb. Comput. 105, 185-233 (2018).
The global Roman domination number of torus graphs and generalized Petersen graphs
Wen, Wu; Liao, Deqin; Zhou, Xiaoqing
J. Comb. Math. Comb. Comput. 105, 235-246 (2018).
A characterization of cocircuits of an es-splitting matroid
Malavadkar, P. P.; Shikare, M. M.; Dhotre, S. B.
J. Comb. Math. Comb. Comput. 105, 247-258 (2018).
Graph designs of four kinds of graphs with nine vertices and nine edges
Zhang, Yanfang; Wang, Guoqiang; Hao, Guohui
J. Comb. Math. Comb. Comput. 105, 259-266 (2018).
Triangle free detour distance in graphs
Keerthi Asir, I.; Athisayanathan, S.
J. Comb. Math. Comb. Comput. 105, 267-288 (2018).
Some properties of the (s,t)-parametric Catalan numbers
Liu, Lily Li; Li, Xiaoli
J. Comb. Math. Comb. Comput. 105, 289-300 (2018).
