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