External Links

    Journal: Discrete Applied Mathematics

    Volume 7, Issue 3

    231 -- 241Frank M. Brown, Yoshihide Igarashi. On permutations of wires and states
    243 -- 250M. Chein, Michel Habib. Jump number of dags having Dilworth number 2
    251 -- 274Michele Conforti, Gérard Cornuéjols. Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem
    275 -- 283Raymond A. Cuninghame-Green. The absolute centre of a graph
    285 -- 296Shimon Even, Azaria Paz. A note on cake cutting
    297 -- 311Jean-Jacques Pansiot. A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
    313 -- 324András Recski. A network theory approach to the rigidity of skeletal structures Part I. Modelling and interconnection
    325 -- 331Douglas R. Shier. Some aspects of perfect elimination orderings in chordal graphs
    335 -- 0Ulrich Faigle. 5th Bonn workshop on combinatorial optimization : June 11-16, 1984 at the University of Bonn, West Germany

    Volume 7, Issue 2

    115 -- 130Martin Farber. Domination, independent domination, and duality in strongly chordal graphs
    131 -- 140Peter C. Fishburn. Probabilities of dominant candidates based on first-place votes
    141 -- 160Claude W. Haigh, John W. Kennedy, Louis V. Quintas. Counting and coding identity trees with fixed diameter and bounded degree
    161 -- 181Peter Kirschenhofer. On the average shape of monotonically labelled tree structures
    183 -- 189Arthur L. Liestman, Dana S. Richards. Toward optimal gossiping schemes with conference calls
    191 -- 199Fionn Murtagh. Counting dendrograms: A survey
    201 -- 208Miroslawa Skowronska, Maciej M. Syslo. An algorithm to recognize a middle graph
    209 -- 220Maciej M. Syslo. Optimal constructions of reversible digraphs
    221 -- 225Peter M. Winkler. Isometric embedding in products of complete graphs

    Volume 7, Issue 1

    1 -- 15Takao Asano, Shunji Kikuchi, Nobuji Saito. A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
    17 -- 21Jaakko T. Astola. The Tietäväinen bound for spherical codes
    23 -- 44Michael W. Carter. The indefinite zero-one quadratic problem
    45 -- 54E. J. Farrell, S. A. Wahid. Matchings in benzene chains
    55 -- 64Hiroshi Maehara. Space graphs and sphericity
    65 -- 78A. Muir, M. W. Warner. Lattice valued relations and automata
    79 -- 91Eugene Seneta, William L. Steiger. 1
    93 -- 103H. P. Williams. A duality theorem for linear congruences
    105 -- 109Satoru Fujishige. A note on Frank's generalized polymatroids
    runs on