External Links

    Journal: Discrete Applied Mathematics

    Volume 69, Issue 3

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

    Volume 69, Issue 1-2

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