On the skew energy of oriented unicyclic digraphs
Wang, Zhao; Ma, Teng; Mao, Yaping; Ye, Chengfu
J. Comb. Math. Comb. Comput. 103, 3-14 (2017).
A note on the adjacent vertex distinguishing total coloring of special planar graphs
Sun, Derong; Sun, Lin
J. Comb. Math. Comb. Comput. 103, 15-25 (2017).
On the Star arboricity of the zero-divisor graph Γ(Zpn)
Escuadro, Henry; Garces, Ian June; Garciano, Agnes; Marcelo, Reginaldo; Ruiz, Mari-Jo P.
J. Comb. Math. Comb. Comput. 103, 27-37 (2017).
Hamiltonicity of domination critical claw-free graphs
Kaemawichanurat, P.; Caccetta, L.
J. Comb. Math. Comb. Comput. 103, 39-62 (2017).
Disjoint K1,4 in claw-free graphs with minimum degree at least four
Gao, Yunshu; Zhou, Haijuan
J. Comb. Math. Comb. Comput. 103, 63-71 (2017).
A Krasnosel’skii type theorem for an orthogonal polytope whose complement contains open boxes
Breen, Marilyn
J. Comb. Math. Comb. Comput. 103, 73-80 (2017).
Intersecting extremal constructions in Ryser’s conjecture for r-partite hypergraphs
Abu-Khazneh, Ahmad; Pokrovskiy, Alexey
J. Comb. Math. Comb. Comput. 103, 81-104 (2017).
One construction of multireceiver authentication codes from pseudo-symplectic geometry over finite fields
Wang, Xiuli; Hao, Yakun
J. Comb. Math. Comb. Comput. 103, 105-114 (2017).
Odd domination in direct and strong products of graphs
Taylor, Dewey T.; Whisenant, Christopher A.
J. Comb. Math. Comb. Comput. 103, 115-125 (2017).
New results on chordal-(k,l) and strongly chordal-(k,l) sandwich problems
Sritharan, R.
J. Comb. Math. Comb. Comput. 103, 127-138 (2017).
A unified approach to lower bound on resolvent Estrada index and resolvent energy of graphs
Zhu, Zhongxun; Hong, Yunchao; Jiang, Meiying
J. Comb. Math. Comb. Comput. 103, 139-146 (2017).
Oriented graphs with minimal skew energy
Mao, Yaping; Gao, Yubo; Wang, Zhao; Ye, Chengfu
J. Comb. Math. Comb. Comput. 103, 147-157 (2017).
The diameter variability of the product graphs
Chithra, M. R.; Vijayakumar, A.
J. Comb. Math. Comb. Comput. 103, 159-170 (2017).
The vertex Folkman numbers Fv(a1,…,as;m−1)=m+9, if max{a1,…,as}=5
Bikov, Aleksandar; Nenov, Nedyalko
J. Comb. Math. Comb. Comput. 103, 171-198 (2017).
A short note on the number of spanning trees in lexicographics product of graphs
Yang, Yujun
J. Comb. Math. Comb. Comput. 103, 199-209 (2017).
Upper bounds on pairs of dot products
Barker, Daniel; Senger, Steven
J. Comb. Math. Comb. Comput. 103, 211-224 (2017).
On the (super) edge-magic deficiency of chain graphs
Ngurah, Anak Agung Gede
J. Comb. Math. Comb. Comput. 103, 225-236 (2017).
The log-behavior of some sequences related to the Catalan-Larcombe-French sequence and the Fennessey-Larcombe-French sequence
Zhao, Feng-Zhen
J. Comb. Math. Comb. Comput. 103, 237-248 (2017).
The neighbor matrix: generalizing a graph’s degree sequence
Roginski, Jonathan W.; Gera, Ralucca M.; Rye, Erik C.
J. Comb. Math. Comb. Comput. 103, 249-265 (2017).
An algorithm on disjoint paths in enhanced hypercubes
Liu, Hongmei; Jin, Dan
J. Comb. Math. Comb. Comput. 103, 267-280 (2017).
The Herscovici’s conjecture for Cm□Cn
Gao, Ze-Tu
J. Comb. Math. Comb. Comput. 103, 281-287 (2017).
The infinite Lights Out problem and symmetric matrices over Z2
Gonçalves, Daniel; Gonçalves, Maria Inez Cardoso
J. Comb. Math. Comb. Comput. 103, 289-295 (2017).
A characterization for a graphic sequence to be potentially K13,4-graphic
Gao, Nan; Yin, Meng-xiao; Zhong, Cheng; Yang, Feng
J. Comb. Math. Comb. Comput. 103, 297-307 (2017).
