Journals in DBLP
R. Julian R. Abel , Frank E. Bennett The existence of perfect Mendelsohn designs with block size 7. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:1-14 [Journal ] Denise Amar , Olivier Togni Irregularity strength of trees. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:15-38 [Journal ] Artur Andrzejak An algorithm for the Tutte polynomials of graphs of bounded treewidth. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:39-54 [Journal ] Esther M. Arkin , Refael Hassin Graph partitions with minimum degree constraints. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:55-65 [Journal ] S. Arumugam , J. Suresh Suseela Acyclic graphoidal covers and path partitions in a graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:67-77 [Journal ] Anant P. Godbole , Laura K. Potter , Erik Jonathan Sandquist Sign-balanced covering matrices. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:79-93 [Journal ] Gregory Gutin , Vadim E. Zverovich Upper domination and upper irredundance perfect graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:95-105 [Journal ] Hugh Hind , Yue Zhao Edge colorings of graphs embeddable in a surface of low genus. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:107-114 [Journal ] K. M. Koh , E. G. Tay On optimal orientations of cartesian products of graphs (I). [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:115-136 [Journal ] Krzysztof Kolodziejczyk The boundary characteristic and the volume of lattice polyhedra. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:137-148 [Journal ] Vladimir P. Korzhik Triangular embeddings of Kn -Km with unboundedly large m. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:149-162 [Journal ] Dieter Kratsch , Jean-Xavier Rampon Tree-visibility orders. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:163-175 [Journal ] S. B. Mulay , C. G. Wagner Finitary bases and formal generating functions. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:177-189 [Journal ] Sanjay Rajpal On binary k-paving matroids and Reed-Muller codes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:191-200 [Journal ] Vassil Yorgov The extremal codes of length 42 with automorphism of order 7. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:201-213 [Journal ] Xuding Zhu Chromatic Ramsey numbers. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:215-222 [Journal ] Riste Skrekovski Choosability of K5 -minor-free graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:223-226 [Journal ] Eberth Alarcon An extremal result on convex lattice polygons. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:227-234 [Journal ] Elena Barcucci , Sara Brunetti , Alberto Del Lungo , Francesco Del Ristoro A combinatorial interpretation of the recurrence fn+1 = 6fn - fn-1 . [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:235-240 [Journal ] Louis Caccetta , Rui-Zhong Jia On a problem concerning ordered colourings. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:241-245 [Journal ] Neil J. Calkin On the structure of a random sum-free set of positive integers. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:247-257 [Journal ] Andrzej Ehrenfeucht , Tero Harju , Paulien ten Pas , Grzegorz Rozenberg Permutations, parenthesis words, and Schröder numbers. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:259-264 [Journal ] Wolf H. Holzmann , Hadi Kharaghani A D-optimal design of order 150. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:265-269 [Journal ] David Moews Optimally pebbling hypercubes and powers. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:271-276 [Journal ] Timothy B. Moorhouse , Derek G. Corneil Completeness for intersection classes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:277-286 [Journal ] Lior Pachter , Peter Kim Forcing matchings on square grids. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:287-294 [Journal ] Gerhard J. Woeginger The toughness of split graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1998, v:190, n:1-3, pp:295-297 [Journal ]