Volume 107, (2018)

Research Article

The chromatic number and some Hamiltonian properties of graphs

Li, Rao

J. Comb. Math. Comb. Comput. 107, 3-15 (2018).

Research Article

Starter labelled graphs and pseudo-starter sequences

Omer, Farej; Shalaby, Nabil

J. Comb. Math. Comb. Comput. 107, 17-43 (2018).

Research Article

Note on competition numbers of generalized (n)-Halin graphs

Zhao, Yongqiang; Cao, Zhijun; Cui, Yonggang; Ye, Guoyan

J. Comb. Math. Comb. Comput. 107, 45-57 (2018).

Research Article

The 2-good-neighbor diagnosability of alternating group graphs under the PMC model and MM* model

Feng, Wei; Wang, Shiying

J. Comb. Math. Comb. Comput. 107, 59-71 (2018).

Research Article

Bounds on the order of connected domination vertex critical graphs

Kaemawichanurat, P.; Caccetta, L.; Ananchuen, N.

J. Comb. Math. Comb. Comput. 107, 73-96 (2018).

Research Article

Hyper-Wiener index and graph properties

Yu, Guidong; Ren, Lifang; Li, Xingxing

J. Comb. Math. Comb. Comput. 107, 97-108 (2018).

Research Article

Steiner Harary index and connectivity of graphs

Li, He; Wang, Zhao; Hu, Piaojuan; Ye, Chengfu

J. Comb. Math. Comb. Comput. 107, 109-114 (2018).

Research Article

Location domination of circulant graphs. II

Tamizh Chelvam, T.; Rani, I.

J. Comb. Math. Comb. Comput. 107, 115-125 (2018).

Research Article

The edge-Hamiltonicity of exchanged folded hypercubes

Zhang, Yanjuan; Liu, Hongmei; Jin, Dan

J. Comb. Math. Comb. Comput. 107, 127-136 (2018).

Research Article

On the relationship between (16, 6, 3)-designs and (25, 12) self-orthogonal codes

Esfahani, Navid Nasr; van Rees, G. H. John

J. Comb. Math. Comb. Comput. 107, 137-147 (2018).

Research Article

Some complementary Gray codes

Hoyt, Adam; Stevens, Brett

J. Comb. Math. Comb. Comput. 107, 149-170 (2018).

Research Article

Line graphs containing 2-factors with bounded number of components

Lai, Hong-Jian; Xiong, Liming; Yan, Huiya

J. Comb. Math. Comb. Comput. 107, 171-179 (2018).

Research Article

Distance duality on some classes of Boolean functions

Stănică, Pantelimon; Sasao, Tsutomu; Butler, Jon T.

J. Comb. Math. Comb. Comput. 107, 181-198 (2018).

Research Article

The t-pebbling conjecture on products of generalized friendship graphs

Yin, Jian-Hua; Gao, Ze-Tu; Hao, Dong-Lin

J. Comb. Math. Comb. Comput. 107, 199-219 (2018).

Research Article

Terminal-pairability in complete graphs

Győri, Ervin; Mezei, Tamás Róbert; Mészáros, Gábor

J. Comb. Math. Comb. Comput. 107, 221-231 (2018).

Research Article

Constructions of 112-designs based on singular symplectic space

Gao, You; Niu, Minyao; Tong, Fenghua

J. Comb. Math. Comb. Comput. 107, 233-248 (2018).

Research Article

Capacity of words

Blecher, Aubrey; Brennan, Charlotte; Knopfmacher, Arnold

J. Comb. Math. Comb. Comput. 107, 249-258 (2018).

Research Article

New bounds on some Lee codes

Zhao, Ning; Wu, Xinling; Li, WanKai; Zhou, Xiaoqing

J. Comb. Math. Comb. Comput. 107, 259-266 (2018).

Research Article

Error-correcting codes based on partial injective maps of finite sets

Qi, Yanfang; Liu, Fenyan; Liu, Junli

J. Comb. Math. Comb. Comput. 107, 267-276 (2018).

Research Article

Exact values for some generalized Ramsey numbers

Sun, Minhong; Shao, Zehui

J. Comb. Math. Comb. Comput. 107, 277-283 (2018).

Research Article

On sharp lower bounds for panconnected, geodesic-pancyclic and path pancyclic graphs

Bi, Zhenming; Zhang, Ping

J. Comb. Math. Comb. Comput. 107, 285-297 (2018).

E-mail Alert

Add your e-mail address to receive upcoming issues of Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC).

Special Issues

The Combinatorial Press Editorial Office routinely extends invitations to scholars for the guest editing of Special Issues, focusing on topics of interest to the scientific community. We actively encourage proposals from our readers and authors, directly submitted to us, encompassing subjects within their respective fields of expertise. The Editorial Team, in conjunction with the Editor-in-Chief, will supervise the appointment of Guest Editors and scrutinize Special Issue proposals to ensure content relevance and appropriateness for the journal. To propose a Special Issue, kindly complete all required information for submission;