Volume 47, (2003)

Information Menu
Archive
Research Article

On m-chromatic factorizations of complete graphs

Chartrand, Gary; Hevia, Héctor; Oellermann, Ortrud R.

J. Comb. Math. Comb. Comput. 47, 3-17 (2003).

Research Article

Minimal complete arcs in PG(2,q),q≤29

Marcugini, Stefano; Milani, Alfredo; Pambianco, Fernanda

J. Comb. Math. Comb. Comput. 47, 19-29 (2003).

Research Article

The number of irreducible polynomials over GF(2) with given trace and subtrace

Cattell, K.; Miers, C. R.; Ruskey, F.; Sawada, J.; Serra, M.

J. Comb. Math. Comb. Comput. 47, 31-64 (2003).

Research Article

Classification of resolvable 2-(14, 7, 12) and 3-(14, 7, 5) designs

Kaski, Petteri; Morales, Luis B.; Östergård, Patrick R. J.; Rosenblueth, David A.; Velarde, Carlos

J. Comb. Math. Comb. Comput. 47, 65-74 (2003).

Research Article

Face two-colourable triangulations of K13

Grannell, M. J.; Griggs, T. S.; Knor, M.

J. Comb. Math. Comb. Comput. 47, 75-81 (2003).

Research Article

On the firefighter problem

MacGillivray, Gary; Wang, Ping

J. Comb. Math. Comb. Comput. 47, 83-96 (2003).

Research Article

Perfect 1-factorizations of K16 with nontrivial automorphism group

Meszka, Mariusz; Rosa, Alexander

J. Comb. Math. Comb. Comput. 47, 97-111 (2003).

Research Article

Optimal fast solutions to the gossip problem

Salerni, Giulio

J. Comb. Math. Comb. Comput. 47, 113-115 (2003).

Research Article

Circular chromatic number of flower graphs

Gao, Guo-Gan; Hahn, Geňa; Zhou, Huishan

J. Comb. Math. Comb. Comput. 47, 117-127 (2003).

Research Article

Hinge systems – spectra and embeddings

Pike, David A.; Raines, Michael E.

J. Comb. Math. Comb. Comput. 47, 129-154 (2003).

Research Article

Some new Bush-type Hadamard matrices of order 100 and infinite classes of symmetric designs

Crnković, Dean; Held, Dieter

J. Comb. Math. Comb. Comput. 47, 155-164 (2003).

Research Article

Graphs with small upper line-distinguishing and upper harmonious chromatic numbers

Hattingh, Johannes H.; Henning, Michael A.; Ungerer, Elna

J. Comb. Math. Comb. Comput. 47, 165-181 (2003).

Research Article

A note on the complexity of graph parameters and the uniqueness of their realizations

Fischermann, Miranca; Rautenbach, Dieter; Volkmann, Lutz

J. Comb. Math. Comb. Comput. 47, 183-188 (2003).

Research Article

Decomposing Eulerian graphs

Horak, Peter

J. Comb. Math. Comb. Comput. 47, 189-200 (2003).

Research Article

Redundance of complete grid graphs

Guichard, David R.

J. Comb. Math. Comb. Comput. 47, 201-212 (2003).

Research Article

Nordhaus-Gaddum results for open irredundance

Cockayne, E. J.

J. Comb. Math. Comb. Comput. 47, 213-223 (2003).

Research Article

Static mastermind

Goddard, Wayne

J. Comb. Math. Comb. Comput. 47, 225-236 (2003).

Research Article

Unique independence, upper domination and upper irredundance in graphs

Fischermann, Miranca; Volkmann, Lutz

J. Comb. Math. Comb. Comput. 47, 237-249 (2003).

Research Article

A lower bound for domination numbers of the queen’s graph: Addendum

Weakley, William D.

J. Comb. Math. Comb. Comput. 47, 251 (2003).

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