Volume 30, (1999)

Information Menu
Archive
Research Article

Polynomial algorithms for special cases of the balanced complete bipartite subgraph problem

Arbib, Claudio; Mosca, Raffaele

J. Comb. Math. Comb. Comput. 30, 3-22 (1999).

Research Article

Vulnerability in graphs—a comparative survey

Moazzami, Dara

J. Comb. Math. Comb. Comput. 30, 23-31 (1999).

Research Article

On intersection numbers, total clique covers and regular graphs

Tsuchiya, Morimasa

J. Comb. Math. Comb. Comput. 30, 33-43 (1999).

Research Article

RESOLVE: An algorithm for the minimum dummy task problem

Boswell, Sharon G.; Eggleton, Roger B.

J. Comb. Math. Comb. Comput. 30, 45-65 (1999).

Research Article

Conditional invariants and interpolation theorems for graphs

Zhou, Sanming

J. Comb. Math. Comb. Comput. 30, 67-89 (1999).

Research Article

Utilization of cut vertices in finding the domination number of a graph

Hare, Eleanor

J. Comb. Math. Comb. Comput. 30, 91-97 (1999).

Research Article

The 1-rotational (52, 4, 1)-RBIBD’s

Buratti, Marco; Zuanni, Fulvio

J. Comb. Math. Comb. Comput. 30, 99-102 (1999).

Research Article

Median graphs: Characterizations, location theory and related structures

Klavžar, Sandi; Mulder, Henry Martyn

J. Comb. Math. Comb. Comput. 30, 103-127 (1999).

Research Article

Factoring a permutation on a broom

Vaughan, Theresa P.

J. Comb. Math. Comb. Comput. 30, 129-148 (1999).

Research Article

An algorithm for finding exact D- and A-optimal designs with n observations and k two-level factors in the presence of autocorrelated errors

Bora-Senta, E.; Moyssiadis, C.

J. Comb. Math. Comb. Comput. 30, 149-170 (1999).

Research Article

Defining sets of projective planes and biplanes and their residuals

Gray, Brenton D.

J. Comb. Math. Comb. Comput. 30, 171-193 (1999).

Research Article

Steiner minimal trees: Their computational past, present, and future

Harris, Frederick C. jun.

J. Comb. Math. Comb. Comput. 30, 195-220 (1999).

Research Article

On avoiding arithmetic progressions whose common differences belong to a given small set

Landman, Bruce M.

J. Comb. Math. Comb. Comput. 30, 221-229 (1999).

Research Article

Independent edges of certain graphs

Chien, Mao-Ting

J. Comb. Math. Comb. Comput. 30, 231-236 (1999).

Research Article

On edge-integrity maximal graphs

Lai, Hong-Jian; Zhang, Xiankun

J. Comb. Math. Comb. Comput. 30, 237-250 (1999).

Research Article

2-(22, 8, 4) designs have no blocks of type 3

McKay, Brendan D.; Radziszowski, Stanisław P.

J. Comb. Math. Comb. Comput. 30, 251-253 (1999).

Research Article

Correction to “Aperiodic complementary quadruples of binary sequences”

Đoković, Dragomir Ž.

J. Comb. Math. Comb. Comput. 30, 254 (1999).

E-mail Alert

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

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;
Propose a Special Issue

News & Announcements