Frank E. Bennett, J. Yin Packings and coverings of the complete directed multigraph with 3- and 4-circuits. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:162, n:1-3, pp:23-29 [Journal]

Zhibo Chen On polynomial functions from Zn_{1} × Zn_{2} × ... × Zn_{r} to Zm. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:162, n:1-3, pp:67-76 [Journal]

K. H. Chew The chromatic index of graphs of high maximum degree. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:162, n:1-3, pp:77-91 [Journal]

Qingyan Du Chromaticity of the complements of paths and cycles. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:162, n:1-3, pp:109-125 [Journal]

F. T. Howard Explicit formulas for degenerate Bernoulli numbers. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:162, n:1-3, pp:175-185 [Journal]

Alexandr V. Kostochka The total chromatic number of any multigraph with maximum degree five is at most seven. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:162, n:1-3, pp:199-214 [Journal]

G. L. Chia On graphs uniquely colorable under the action of their automorphism groups. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:162, n:1-3, pp:281-284 [Journal]

G. L. Chia On the chromatic equivalence class of a family of graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:162, n:1-3, pp:285-289 [Journal]

P. Hoffmann Counting maximal cycles in binary matroids. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:162, n:1-3, pp:291-292 [Journal]

Anthony J. Macula A simple construction of d-disjunct matrices with certain constant weights. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:162, n:1-3, pp:311-312 [Journal]