New small trivalent graphs for girths 17,18 and 20
Exoo, Geoffrey
J. Comb. Math. Comb. Comput. 113, 3-10 (2020).
C6-decomposition of the tensor product of complete graphs
Akwu, A. D.; Oyewumi, O.
J. Comb. Math. Comb. Comput. 113, 11-15 (2020).
Algebraic characterization of the SSC \(\Delta_S(\mathcal{G}^1_{n,r})\)
Kashif, Agha; Raza, Zahid; Anwar, Imran
J. Comb. Math. Comb. Comput. 113, 17-30 (2020).
The second largest number of maximal independent sets in twinkle graphs
Lin, Jenq-Jong; Jou, Min-Jen
J. Comb. Math. Comb. Comput. 113, 31-48 (2020).
On the stronger reconstruction of nearly acyclic graphs
Monikandan, S.; Mathi, N. Kalai
J. Comb. Math. Comb. Comput. 113, 49-64 (2020).
Vertex-distinguishing I- and VI-total colorings of \(S_m\vee F_n\), \(S_m\vee W_n\) and \(F_n\vee W_n\)
Li, Rong; Chen, Xiang’en
J. Comb. Math. Comb. Comput. 113, 65-78 (2020).
Maximizing algebraic connectivity for quasi-tree graphs with given matching number
Zhang, Rong; Guo, Shu-Guang
J. Comb. Math. Comb. Comput. 113, 79-95 (2020).
Double Italian and double Roman domination in digraphs
Volkmann, Lutz
J. Comb. Math. Comb. Comput. 113, 97-108 (2020).
A class of bipartite and antipodal graphs and their uniform posets
Houm, Lihang; Liu, Wen
J. Comb. Math. Comb. Comput. 113, 109-118 (2020).
On the Ramsey numbers \(r(S_n,K_6-3K_2)\)
Lortz, Roland; Mengersen, Ingrid
J. Comb. Math. Comb. Comput. 113, 119-126 (2020).
A note on the maximum rectilinear crossing number of spiders
Fallon, Joshua; Hogenson, Kirsten; Keough, Lauren; Lomelí, Mario; Schaefer, Marcus; Soberon, Pablo
J. Comb. Math. Comb. Comput. 113, 127-139 (2020).
A polynomial-time algorithm for cluster deletion on (diamond, Butterfly)-free graphs
Malek, Sabrine; Naanaa, Wady
J. Comb. Math. Comb. Comput. 113, 141-153 (2020).
3-equitable total labeling of graphs
Kathiresan, K. M.; Sivakumar, R.
J. Comb. Math. Comb. Comput. 113, 155-163 (2020).
The edge-distinguishing chromatic number of spider graphs with three legs or bounded leg lengths
Fickes, Grant; Wong, Tony W. H.
J. Comb. Math. Comb. Comput. 113, 165-181 (2020).
Computing cardinalities of subsets on Sn with k adjacencies
Chitturi, Bhadrachalam
J. Comb. Math. Comb. Comput. 113, 183-195 (2020).
Paired domination subdivision and multisubdivision numbers of graphs
Raczek, Joanna; Dettlaff, Magda
J. Comb. Math. Comb. Comput. 113, 197-212 (2020).
Hamiltonian walks and Hamiltonian-connected 3-path graphs
Byers, Alexis; Hallas, Jamie; Olejniczak, Drake; Zayed, Mohra; Zhang, Ping
J. Comb. Math. Comb. Comput. 113, 213-231 (2020).
On inclusive and non-inclusive vertex irregular \(d\)-distance vertex labelings
Bong, Novi H.; Lin, Yuqing; Slamin
J. Comb. Math. Comb. Comput. 113, 233-247 (2020).
A note on putative \((101,10)\)-arcs in \(PG(2,11)\)
Braun, Michael
J. Comb. Math. Comb. Comput. 113, 249-252 (2020).
Chromatic number and Hamiltonicity of graphs
Li, Rao
J. Comb. Math. Comb. Comput. 113, 253-257 (2020).
An identity for the odd double factorial
Hussein, Saud
J. Comb. Math. Comb. Comput. 113, 259-261 (2020).
Crossing number bounds for mesh connected and 3-regular mesh of trees
Gayathri, S.; Bharati, R.
J. Comb. Math. Comb. Comput. 113, 263-280 (2020).
Connectivity of single-element coextensions of a binary matroid
Mundhe, Ganesh; Borse, Y. M.
J. Comb. Math. Comb. Comput. 113, 281-288 (2020).
Co-secure domination in Mycielski graphs
Manjusha, P.; Chithra, M. R.
J. Comb. Math. Comb. Comput. 113, 289-297 (2020).
Planarity, duality and Laplacian congruence
Smith, Derek A.; Traldi, Lorenz; Watkins, William
J. Comb. Math. Comb. Comput. 113, 299-321 (2020).
