David W. Barnette Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:85, n:1, pp:1-16 [Journal]
Mao-cheng Cai The maximal size of graphs with at most k edge-disjoint paths connecting any two adjacent vertices. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:85, n:1, pp:43-52 [Journal]
Alexander V. Karzanov Packings of cuts realizing distances between certain vertices in a planar graph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:85, n:1, pp:73-87 [Journal]
Maolin Zheng, Xiaoyun Lu On the maximum induced forests of a connected cubic graph without triangles. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:85, n:1, pp:89-96 [Journal]