Bulletin of the ICA

Volume 39, September, 2003

• News
• H.S.M. Coxeter
• Announcements
• E.J. Farrell, "The Simple-Cover Clique Polynomial", pp. 7-15
• Adrian Riskin, "On the outerplanar crossing number K_m,n", pp. 16-20
• P.D. Johnson, Jr and E.J. Morgan, "Sharpening the Faudree-Knisley Theorem on (2,r)-Regularity", pp. 21-26
• Y.C. Chang and H.L. Fu, "The Number of 6-cycles in a Graph", pp. 27-30
• A.N.M. Salman, E.T Baskoro, H.J. Broersma and C.A. Rodger, "More on spanning 2-connected subgraphs in truncated rectangular grid graphs", pp. 31-38
• N.C.K. Phillips and W.D. Wallis, "An Elusive Array", pp. 39-40
• David Bedford and Roger M. Whitaker, "Quasi-Orthogonal Latin Squares and their Applications", pp. 41-52
• Glenn G. Chappell, Peter D. Johnson, Jr and Evan B. Wantland, "Hall t-Chromatic Graphs", pp. 53-63
• T.S. Michael, "Impossible Decompositions of Complete Graphs into Three Petersen Subgraphs", pp. 64-66
• Edward J. Farrell, Michael L. Gargano and L.V. Quintas, "Spanning Trees in Linear Polygonal Chains", pp. 67-74
• A. Cossidente and M.J. de Resmini, "Construction of designs which contain a unital", pp. 75-77
• Bulletin Policy
• Richard Anstee, Ayongga and Sheng Bau, "Cycles Containing Large Subsets of a Specified Set in Cubic Graphs", pp. 79-84
• E. Mendelsohn, M. Meszka and A. Rosa, "Packing Petersen Graphs into K₁₀", pp. 85-86
• E.J. Cockayne, O. Favaron and C.M. Mynhardt, "Secure Domination, Weak Roman Domination and Forbidden Graphs", pp. 87-100
• Recent Conferences