János Pach Graphs whose every independent set has a common neighbour. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1981, v:37, n:2-3, pp:217-228 [Journal]

H. M. Shefrin On the combinatorial structure of Bayesian learning with imperfect information. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1981, v:37, n:2-3, pp:245-254 [Journal]

Ioan Tomescu Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1981, v:37, n:2-3, pp:263-277 [Journal]

Hian Poh Yap On graphs whose maximal subgraphs have at most two orbits. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1981, v:37, n:2-3, pp:279-287 [Journal]

Hian Poh Yap On graphs critical with respect to edge-colourings. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1981, v:37, n:2-3, pp:289-296 [Journal]

Maciej M. Syslo The Helly-type property of non-trivial intervals on a tree. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1981, v:37, n:2-3, pp:297-298 [Journal]