Discrete Applied Mathematics, Volume 69

Volume 69, Number 1-2, August 1996

• Karl Nachtigall:
  Periodic Network Optimization with Different Arc Frequencies. 1-17
  Electronic Edition (link) BibTeX
• Meei Pyng Ng, Nicholas C. Wormald:
  Reconstruction of Rooted Trees From Subtrees. 19-31
  Electronic Edition (link) BibTeX
• Jeffrey Wood, John Shawe-Taylor:
  Representation Theory and Invariant Neural Networks. 33-60
  Electronic Edition (link) BibTeX
• János Demetrovics, Vu Duc Thi:
  Some Results About Normal Forms for Functional Dependency in the Relational Datamodel. 61-74
  Electronic Edition (link) BibTeX
• Gregory Gutin, Anders Yeo:
  Ranking the Vertices of a Complete Multipartite Paired Comparison Digraph. 75-82
  Electronic Edition (link) BibTeX
• Hyeong-Seok Lim, Jung-Heum Park, Kyung-Yong Chwa:
  Embedding Trees in Recursive Circulants. 83-99
  Electronic Edition (link) BibTeX
• Dennis Pixton:
  Regularity of Splicing Languages. 101-124
  Electronic Edition (link) BibTeX
• Peter W. Stephens:
  Gap Strings and Spanning Forests for Bridge Graphs of Biconnected Graphs. 125-145
  Electronic Edition (link) BibTeX
• Heping Zhang, Fuji Zhang:
  The Clar Covering Polynomial of Hexagonal Systems I. 147-167
  Electronic Edition (link) BibTeX
• V. Balachandhran, C. Pandu Rangan:
  All-pairs-shortest-length on Strongly Chordal Graphs. 169-182
  Electronic Edition (link) BibTeX
• Zhi-Zhong Chen, Xin He:
  Parallel Complexity of Partitioning a Planar Graph Into Vertex-induced Forests. 183-198
  Electronic Edition (link) BibTeX

Volume 69, Number 3, August 1996

• Carsten Flotow:
  On Powers of Circular Arc Graphs and Proper Circular Arc Graphs. 199-207
  Electronic Edition (link) BibTeX
• Kazuhisa Makino, Toshihide Ibaraki:
  Interior and Exterior Functions of Boolean Functions. 209-231
  Electronic Edition (link) BibTeX
• Lee Aaron Newberg:
  The Number of Clone Orderings. 233-245
  Electronic Edition (link) BibTeX
• Jing-Ho Yan, Jer-Jeong Chen, Gerard J. Chang:
  Quasi-threshold Graphs. 247-255
  Electronic Edition (link) BibTeX
• Jason I. Brown:
  The Complexity of Generalized Graph Colorings. 257-270
  Electronic Edition (link) BibTeX
• Josep Fàbrega, Miguel Angel Fiol:
  Bipartite Graphs and Digraphs with Maximum Connectivity. 271-279
  Electronic Edition (link) BibTeX
• Samir Khuller, Balaji Raghavachari, Neal E. Young:
  On Strongly Connected Digraphs with Bounded Cycle Length. 281-289
  Electronic Edition (link) BibTeX