Discrete Mathematics, Volume 195

Volume 195, Numbers 1-3, January 1999

• B. Devadas Acharya, Purnima Gupta:
  On point-set domination in graphs IV: Separable graphs with unique minimum psd-sets. 1-13
  
• Ahmed M. Assaf, Ruizhong Wei:
  Modified group divisible designs with block size 4 and lambda = 1. 15-25
  
• M. D. Atkinson:
  Restricted permutations. 27-38
  
• Camino Balbuena:
  Extraconnectivity of s-geodetic digraphs and graphs. 39-52
  
• LeRoy B. Beasley, Sylvia D. Monson, Norman J. Pullman:
  Linear operators that strongly preserve graphical properties of matrices - II. 53-66
  
• Béla Bollobás, Oliver Riordan, Zdenek Ryjácek, Akira Saito, Richard H. Schelp:
  Closure and Hamiltonian-connectivity of claw-free graphs. 67-80
  
• Beifang Chen, Sanming Zhou:
  Domination number and neighbourhood conditions. 81-91
  
• Dominique de Werra, Alain Hertz:
  On perfectness of sums of graphs. 93-101
  
• Moshe Dror, Gerd Finke, Sylvain Gravier, Wieslaw Kubiak:
  On the complexity of a restricted list-coloring problem. 103-109
  
• Peter C. Fishburn, William T. Trotter:
  Split semiorders. 111-126
  
• Weidong Gao:
  On the number of subsequences with given sum. 127-138
  
• Tor Helleseth, Chunming Rong, Kyeongcheol Yang:
  New infinite families of 3-designs from preparata codes over Z₄. 139-156
  
• S. R. Kingan:
  Intersections of circuits and cocircuits in binary matroids. 157-165
  
• Horst Martini, Petru Soltan:
  On convex partitions of polygonal regions. 167-180
  
• A. Muthusamy, P. Paulraja:
  Path factorizations of complete multipartite graphs. 181-201
  
• Bogdan Oporowski:
  Minor-equivalence for infinite graphs. 203-227
  
• Alexander A. Ageev:
  Every circle graph of girth at least 5 is 3-colourable. 229-233
  
• Aron C. Atkins, Gábor N. Sárközy, Stanley M. Selkow:
  Counting irregular multigraphs. 235-237
  
• David W. Barnette, Shelley Gillett:
  Paths and circuits in partially directed graphs. 239-243
  
• Marston Conder:
  Explicit definition of the binary reflected Gray codes. 245-249
  
• Penny E. Haxell:
  Packing and covering triangles in graphs. 251-254
  
• Jiong-Sheng Li, Zi-Xia Song:
  On the potentially P_k-graphic sequences. 255-262
  
• Dingjun Lou:
  A local independence number condition for n-extendable graphs. 263-268
  
• Ying Miao, Sanpei Kageyama:
  Two classes of q-ary codes based on group divisible association schemes. 269-276
  
• Jianguo Qian:
  On the upper bound of the diameter of interchange graphs. 277-285
  
• Martin Sutton, Mirka Miller, Joseph F. Ryan, Slamin:
  Connected graphs which are not mod sum graphs. 287-293
  
• Zhongfu Zhang, Baogen Xu, Yinzhen Li, Linzhong Liu:
  A note on the lower bounds of signed domination number of a graph. 295-298