Thomas Andreae Reconstructing the degree sequence and the number of components of an infinite graph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:39, n:1, pp:1-7 [Journal]

Robert A. Chaffer A construction of orthogonal arrays and applications to embedding theorems. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:39, n:1, pp:23-29 [Journal]

E. J. Farrell A note on the circuit polynomials and characteristic polynomials of wheels and ladders. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:39, n:1, pp:31-36 [Journal]

András Frank A note on k-strongly connected orientations of an undirected graph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:39, n:1, pp:103-104 [Journal]

Peter Hammond On the non-existence of perfect and nearly perfect codes. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:39, n:1, pp:105-109 [Journal]

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP