Krishnaswami Alladi A variation on a theme of Sylvester - a smoother road to Göllnitz's (Big) theorem. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:196, n:1-3, pp:1-11 [Journal]

Owen D. Byer Two path extremal graphs and an application to a Ramsey-type problem. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:196, n:1-3, pp:51-64 [Journal]

John S. Caughman IV The Terwilliger algebras of bipartite P- and Q-polynomial schemes. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:196, n:1-3, pp:65-95 [Journal]

Tung-Shan Fu Erdös-Ko-Rado-type results over J_{q}(n, d), H_{q}(n, d) and their designs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:196, n:1-3, pp:137-151 [Journal]

Albert Gräf Distance graphs and the T-coloring problem. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:196, n:1-3, pp:153-166 [Journal]

Zhiquan Hu A generalization of fan's condition and forbidden subgraph conditions for hamiltonicity. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:196, n:1-3, pp:167-175 [Journal]

Stanislav Jendrol Triangles with restricted degrees of their boundary vertices in plane triangulations. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:196, n:1-3, pp:177-196 [Journal]

Arnold Knopfmacher On the degrees of irreducible factors of polynomials over a finite field. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:196, n:1-3, pp:197-206 [Journal]

B. S. Panda The forbidden subgraph characterization of directed vertex graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:196, n:1-3, pp:239-256 [Journal]

J. A. Rodríguez, José Luis Andres Yebra Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:196, n:1-3, pp:267-275 [Journal]