Discrete Applied Mathematics, Volume 66

Volume 66, Number 1, 1996

Jean-Paul Allouche, Fritz von Haeseler, Heinz-Otto Peitgen, Guentcho Skordev:
Linear Cellular Automata, Finite Automata and Pascal's Triangle. 1-22
Richard C. Brewster, Gary MacGillivray:
Homomorphically Full Graphs. 23-31
Collette R. Coullard, Abdur Rais, Ronald L. Rardin, Donald K. Wagner:
The Dominant of the 2-connected-Steiner-subgraph Polytope for W₄-free Graphs. 33-43
Fanica Gavril:
Intersection Graphs of Helly Families of Subtrees. 45-56
Bernard Mans, Catherine Roucairol:
Performances of Parallel Branch and Bound Algorithms with Best-first Search. 57-74
Carla Antoni, Angela Dalena: On a Problem of P. Erds. 75-79
Bintong Chen, Bharatendu Srivastava:
An Improved Lower Bound for the Bin Packing Problem. 81-94
Jaroslaw Grytczuk:
Intertwined Infinite Binary Words. 95-99

Robert C. Brigham, Fred R. McMorris, Richard P. Vitray:
Two - ø - Tolerance Competition Graphs. 101-108
F. Cheah, Derek G. Corneil:
on the Structure of Trapezoid Graphs. 109-133
Norman J. Finizio:
An Infinite Class of Z-cyclic Whist Tournaments on v Players, v 1 (mod 4). 135-146
Chain-Chin Yen, Richard C. T. Lee:
The Weighted Perfect Domination Problem and Its Variants. 147-160
Stanislaw Zdrzalka:
A Sequencing Problem with Family Setup Times. 161-183
Eberhard Triesch:
A Group Testing Problem for Hypergraphs of Bounded Rank. 185-188

Maw-Shang Chang, Yi-Hua Chen, Gerard J. Chang, Jing-Ho Yan:
Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs. 189-203
Tibor Hegedüs, Nimrod Megiddo:
on the Geometric Separability of Boolean Functions. 205-218
Chính T. Hoàng:
on the Complexity of Recognizing a Class of Perfectly orderable Graphs. 219-226
Thomas Kämpke:
Lower Probabilities and Function Representation. 227-243
Kathleen A. McKeon:
The Expected Number of Symmetries in Locally Restricted Trees II. 245-253
David B. Peters, Joseph G. Peters:
Bounded Depth Broadcasting. 255-270
Robert C. Powers:
Arrow's Theorem for Closed Weak Hierarchies. 271-278