|
Journals in DBLP
- Safwan Akkari
A minimal 3-connectedness result for matroids. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:103, n:3, pp:221-232 [Journal]
- Zoltán Füredi, Péter Hajnal
Davenport-Schinzel theory of matrices. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:103, n:3, pp:233-251 [Journal]
- A. Gardiner
Almost rank three graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:103, n:3, pp:253-257 [Journal]
- Daniel E. Loeb
A generalization of the Stirling numbers. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:103, n:3, pp:259-269 [Journal]
- Charles Payan
On the chromatic number of cube-like graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:103, n:3, pp:271-277 [Journal]
- Ron M. Roth, Abraham Lempel
t-sum generators of finite Abelian groups. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:103, n:3, pp:279-292 [Journal]
- László A. Székely, L. H. Clark, Roger C. Entringer
An inequality for degree sequences. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:103, n:3, pp:293-300 [Journal]
- Miroslaw Truszczynski, Zsolt Tuza
Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:103, n:3, pp:301-312 [Journal]
- David C. Fisher, Jennifer Ryan
Bounds on the number of complete subgraphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:103, n:3, pp:313-320 [Journal]
- Julie Haviland, Andrew Thomason
On testing the 'pseudo-randomness' of a hypergraph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:103, n:3, pp:321-327 [Journal]
|