Journals in DBLP
Richard A. Brualdi , A. Samad Hedayat , Hadi Kharaghani , Gholamreza B. Khosrovshahi , Shahriar Shahriari Preface. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:2989- [Journal ] Gholamreza B. Khosrovshahi , Behruz Tayfeh-Rezaie Large sets of t-designs through partitionable sets: A survey. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:2993-3004 [Journal ] Saeed Akbari , H. Bidkhori , N. Nosrati r-Strong edge colorings of graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3005-3010 [Journal ] Saeed Akbari , O. Etesami , H. Mahini , M. Mahmoody , A. Sharifi Transversals in long rectangular arrays. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3011-3013 [Journal ] R. A. Bailey , Peter J. Cameron , Peter Dobcsányi , John P. Morgan , Leonard H. Soicher Designs on the web. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3014-3027 [Journal ] Richard Bean Latin trades on three or four rows. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3028-3041 [Journal ] Majid Behbahani , Hadi Kharaghani On a new class of productive regular Hadamard matrices. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3042-3050 [Journal ] Andries E. Brouwer , Peter J. Cameron , Willem H. Haemers , D. A. Preece Self-dual, not self-polar. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3051-3053 [Journal ] Richard A. Brualdi Algorithms for constructing (0, 1)-matrices with prescribed row and column sum vectors. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3054-3062 [Journal ] Peter J. Cameron , Hamid Reza Maimani , G. R. Omidi , Behruz Tayfeh-Rezaie 3-Designs from PSL(2, q). [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3063-3073 [Journal ] Peter J. Cameron , Charles R. Johnson The number of equivalence classes of symmetric sign patterns. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3074-3077 [Journal ] Saieed Akbari , Hamid-Reza Fanaï Some relations among term rank, clique number and list chromatic number of a graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3078-3082 [Journal ] Nick C. Fiala , Willem H. Haemers 5-chromatic strongly regular graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3083-3096 [Journal ] Zoltán Füredi , Robert H. Sloan , Ken Takata , György Turán On set systems with a threshold property. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3097-3111 [Journal ] A. Sadam Hedayat , Min Yang Efficient crossover designs for comparing test treatments with a control treatment. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3112-3124 [Journal ] C. R. Johnson , António Leal Duarte Converse to the Parter-Wiener theorem: The case of non-trees. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3125-3129 [Journal ] Charles R. Johnson , Carlos M. Saiago The trees for which maximum multiplicity implies the simplicity of other eigenvalues. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3130-3135 [Journal ] Reza Naserasr , Yared Nigussie On a new reformulation of Hadwiger's conjecture. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3136-3139 [Journal ] Tim Hsu , Mark J. Logan , Shahriar Shahriari The generalized Füredi conjecture holds for finite linear lattices. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3140-3144 [Journal ] Carsten Thomassen The number of k-colorings of a graph on a fixed surface. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3145-3153 [Journal ] Richard M. Wilson A lemma on polynomials modulo pm and applications to coding theory. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3154-3165 [Journal ] Manouchehr Zaker Results on the Grundy chromatic number of graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3166-3173 [Journal ] Peter J. Cameron Research problems from the 2003 IPM Workshop. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3174-3179 [Journal ]