Volume 159, Numbers 1-3, November 1996
- David W. Bange, Anthony E. Barkauskas, Linda H. Host, Peter J. Slater:
Generalized domination and efficient domination in graphs.
1-11
- Moussa Benoumhani:
On Whitney numbers of Dowling lattices.
13-33
- Endre Boros, Vladimir Gurvich:
Perfect graphs are kernel solvable.
35-55
- Ernest J. Cockayne, Odile Favaron, Christina M. Mynhardt:
Universal maximal packing functions of graphs.
57-68
- René van Dal, Gert A. Tijssen, Zsolt Tuza, Jack A. A. van der Veen, Christina Zamfirescu, Tudor Zamfirescu:
Hamiltonian properties of Toeplitz graphs.
69-81
- Dikran Dikranjan, Alberto Policriti:
Complementation in the lattice of equivalence relations.
83-94
- Suohai Fan:
On End-regular graphs.
95-102
- Odile Favaron, Hao Li, Richard H. Schelp:
Strong edge colorings of graphs.
103-109
- R. W. Goldbach, H. L. Claasen:
Feasibility conditions for non-symmetric 3-class association schemes.
111-118
- Shai Gutner:
The complexity of planar graph choosability.
119-130
- Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra:
Small cutsets in quasiminimal Cayley graphs.
131-142
- Erik R. Hauge, Tor Helleseth:
De Bruijn sequences, irreducible codes and cyclotomy.
143-154
- Charles R. Johnson, Terry A. McKee:
Structural conditions for cycle completable graphs.
155-160
- Warren P. Johnson:
q-Extensions of identities of Abel-Rothe type.
161-177
- Van Bang Le:
Gallai graphs and anti-Gallai graphs.
179-189
- Miroslav Ploscica, Miron Zelina:
Cancellation among finite unary algebras.
191-198
- Daniel P. Sanders:
On circuits through five edges.
199-215
- Rudolf Schneider:
On the chairman assignment problem.
217-222
- Steven J. Winters:
Connected graphs with prescribed median and periphery.
223-236
- Hacène Aït Haddadène, Sylvain Gravier:
On weakly diamond-free Berge graphs.
237-240
- Cheng Bo, Bolian Liu:
Some inequalities about connected domination number.
241-245
- Oleg V. Borodin:
Irreducible graphs in the Grünbaum-Havel 3-colour problem.
247-249
- Michael J. Caulfield:
Full and quarter plane complete infinite latin squares.
251-253
- Manoj K. Chari:
Reversible shellings and an inequality for h-vectors.
255-259
- Leo G. Chouinard:
Bounding graphical t-wise balanced designs.
261-263
- Virgil Domocos:
Minimal coverings of uniform hypergraphs and P-recursiveness.
265-271
- M. Hirschhorn:
Calkin's binomial identity.
273-278
- Yoshiyasu Ishigami:
An extremal problem of d permutations containing every permutation of every t elements.
279-283
- Clay Mauk, Saul Stahl:
Cubic graphs whose average number of regions is small.
285-290
- Yue-Li Wang:
On the bondage number of a graph.
291-294
- Xiang-De Zhang:
On the spiral property of the q-derangement numbers.
295-298
Last update Mon May 20 16:58:47 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
