Ars Combinatoria
Volume LXIX, October, 2003

  • Akira Saito and Tomoki Yamashita, “A Note on Dominating Cycles in Tough Graphs”
  • Shung-Liang Wu, “New Families of Sequential Graphs”
  • Alois Panholzer, “The Height Distribution of Nodes in Non-Crossing Trees”
  • Garth Isaak, Kathryn L. Nyman and Ann N. Trenk, “A Hierarchy of Classes of Bounded Bitolerance Orders”
  • M. Cera, A. Dianez, P. Garcia-Vazquez and J.C. Valenzuela, “Complete bipartite free graphs”
  • Phyllis Chinn, Ralph Grimaldi and Silvia Heubach, “The Frequency of Summands of a Particular Size in Palindromic Compositions”
  • S. Georgiou and C. Koukouvinos, “On equivalence of Hadamard matrices and projection properties”
  • W. Edwin Clark, Mourad E.H. Ismail and Stephen Suen, “Application of Upper and Lower Bounds for the Domination Number to Vizing’s Conjecture”
  • A. Panayotolpoulos and A. Sapounakis, “On Motzkin words and noncrossing partitions”
  • I.D. Gray, J.A. MacDougall, R.J. Simpson and W.D. Wallis, “Vertex-Magic Total Labelings of Complete Bipartite Graphs”
  • M.M. Jaradat, “On The Hamiltonian Decomposition of Special Product of Graphs”
  • James A. Sellers, “Parity Results for p-Regular Partitions with Distinct Parts”
  • Sheng Bau, Michael A. Henning and Peter Dankelmann, “Average lower independence in trees and outerplanar graphs”
  • Tomoki Nakamigawa, “A Note on the Decomposition Dimension of Complete Graphs”
  • Clark Kimberling, “A Run-length Operator on Partitions of Integers, Applied to Inventory Chains”
  • Daphne Der-Fen Liu and Xuding Zhu, “Circulant Distant Two Labeling and Circular Chromatic Number”
  • Frank Rubin, “Improved Knight Coverings ”
  • M.J. Grannell, T.S. Griggs, K.A.S. Quinn, B.M. Maenhaut and R.G. Stanton, “More on exact bicoverings of 12 points”
  • Masakazu Nihei, “Algebraic connectivity of the line graph, the middle graph and the total graph of a regular graph”
  • Dingjun Lou, Akira Saito and Lihua Teng, “To Determine 1-Extendable Graphs and its Algorithm”
  • Er-Fang Shan, Moo Young Sohn and Li-ying Kang, “Upper bounds on signed 2-independence number of graphs”
  • V. Swaminathan and P. Thangaraju, “Phi-Strong (weak) domination in a graph”
  • K.J. Roblee, “Triangle-Free Regular Graphs as an Extremal Family”
  • David C. Fisher, “On the n x n Knight Cover Problem”
  • Stephen G. Hartke and Aparna W. Higgins, “Minimum Degree Growth of the Iterated Line Graph”
  • E.S. Laber and E.L. Monte Carmelo, “A Note on multicolor bipartite Ramsey numbers for K_{2,n}”
  • Michael Minic and R. Calahan Zijlstra, “Steiner Triple Systems with Automorphism Type [1,0,0,0,0,0,0,t,0,…0,1,0,…0]”
  • Amir Daneshgar and Reza Naserasr, “On Some Parameters Related to Uniquely Vertex-Colourable Graphs and Defining Sets”