Volume 6; Issue 2

Discrete Applied Mathematics

Volume 6; Issue 2
2

The number of rounds needed to exchange information within a graph

Susan F. Assmann, Daniel J. Kleitman
Journal:
Discrete Applied Mathematics
Year:
1983
Language:
english
File:
PDF, 446 KB
english, 1983
4

The vertices of the knapsack polytope

A.C. Hayes, D.G. Larman
Journal:
Discrete Applied Mathematics
Year:
1983
Language:
english
File:
PDF, 222 KB
english, 1983
5

On powers and centers of chordal graphs

Renu Laskar, Douglas Shier
Journal:
Discrete Applied Mathematics
Year:
1983
Language:
english
File:
PDF, 486 KB
english, 1983
6

An efficient algorithm for the complete set partitioning problem

Chien-Hua M. Lin, Harvey M. Salkin
Journal:
Discrete Applied Mathematics
Year:
1983
Language:
english
File:
PDF, 439 KB
english, 1983
7

Bivalent trees and forests or upper bounds for the probability of a union revisited

Willi Maurer
Journal:
Discrete Applied Mathematics
Year:
1983
Language:
english
File:
PDF, 893 KB
english, 1983
9

On qualitatively independent partitions and related problems

Svatopluk Poljak, Aleš Pultr, Voljtěch Rödl
Journal:
Discrete Applied Mathematics
Year:
1983
Language:
english
File:
PDF, 660 KB
english, 1983
10

A new Van der Waerden number

Michael D. Beeler
Journal:
Discrete Applied Mathematics
Year:
1983
Language:
english
File:
PDF, 45 KB
english, 1983
12

Comments on “a note on Reed-Muller codes”

Manohar Lal Kaushik
Journal:
Discrete Applied Mathematics
Year:
1983
Language:
english
File:
PDF, 96 KB
english, 1983
13

Book announcements

Journal:
Discrete Applied Mathematics
Year:
1983
Language:
english
File:
PDF, 118 KB
english, 1983