|
Journals in DBLP
- Charles Curtis Lindner, Christopher A. Rodger
A connection between varieties of quasigroups and graph decompositions. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:272, n:2-3, pp:127-137 [Journal]
- John G. Gimbel, Chris Hartman
Subcolorings and the subchromatic number of a graph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:272, n:2-3, pp:139-154 [Journal]
- Yanxun Chang, Giovanni Lo Faro
The existence of directed BIBDs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:272, n:2-3, pp:155-169 [Journal]
- Gary Chartrand, Teresa W. Haynes, Michael A. Henning, Ping Zhang
Stratification and domination in graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:272, n:2-3, pp:171-185 [Journal]
- Ervin Györi, Vladimir Nikiforov, Richard H. Schelp
Nearly bipartite graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:272, n:2-3, pp:187-196 [Journal]
- Gejza Jenca
Finite homogeneous and lattice ordered effect algebras. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:272, n:2-3, pp:197-214 [Journal]
- S. Ole Warnaar
The generalized Borwein conjecture. II. Refined q-trinomial coefficients. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:272, n:2-3, pp:215-258 [Journal]
- Amitava Bhattacharya
On a conjecture of Manickam and Singhi. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:272, n:2-3, pp:259-261 [Journal]
- Bostjan Bresar, Blaz Zmazek
On the independence graph of a graph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:272, n:2-3, pp:263-268 [Journal]
- Keith Edwards
Edge decomposition of complete tripartite graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:272, n:2-3, pp:269-275 [Journal]
- Gennian Ge, J. Wang, Rolf S. Wei
MGDD with block size 4 and its application to sampling designs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:272, n:2-3, pp:277-283 [Journal]
- Sylvain Gravier, Chính T. Hoàng, Frédéric Maffray
Coloring the hypergraph of maximal cliques of a graph with no long path. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:272, n:2-3, pp:285-290 [Journal]
- S. K. Gupta, Pankaj Mangal, Vineet Paliwal
Some work towards the proof of the reconstruction conjecture. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:272, n:2-3, pp:291-296 [Journal]
- Robert E. Jamison, Peter D. Johnson Jr.
The structure of (t, r)-regular graphs of large order. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:272, n:2-3, pp:297-300 [Journal]
|