Journals in DBLP
Michael H. Albert , Derek A. Holton , Richard J. Nowakowski The ultimate categorical matching in a graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:1-9 [Journal ] Javier Bracho , Ricardo Strausz Nonisomorphic complete triangulations of a surface. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:11-18 [Journal ] Gary Gordon , Elizabeth W. McMahon A characteristic polynomial for rooted graphs and rooted digraphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:19-33 [Journal ] Ivan Gutman , Irene Sciriha On the nullity of line graphs of trees. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:35-45 [Journal ] Masahiro Hachimori Deciding constructibility of 3-balls with at most two interior vertices. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:47-58 [Journal ] Alexej P. Pynko Implicational classes of De Morgan Boolean algebras. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:59-66 [Journal ] Constantin Smadici On a combinatorial problem. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:67-76 [Journal ] George E. Andrews , Richard P. Lewis An algebraic identity of F.H. Jackson and its implications for partitions. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:77-83 [Journal ] George E. Andrews , Richard P. Lewis Restricted bipartitions. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:85-89 [Journal ] M. Bayat , H. Teimoori Minimal polynomial of Pascal matrices over the field Z p . [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:91-94 [Journal ] Joseph E. Bonin , Hongxun Qin Tutte polynomials of q -cones. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:95-103 [Journal ] Celina M. Herrera de Figueiredo , Sylvain Gravier , Cláudia Linhares Sales On Tucker's proof of the strong perfect graph conjecture for (K 4 -e )-free graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:105-108 [Journal ] Jeffrey H. Dinitz , Alan C. H. Ling The existence of referee squares. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:109-112 [Journal ] Frank G. Garvan A generalization of the Hirschhorn-Farkas-Kra septagonal numbers identity. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:113-118 [Journal ] Ira M. Gessel Acyclic orientations and chromatic generating functions. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:119-130 [Journal ] Jochen Harant , Ingo Schiermeyer On the independence number of a graph in terms of order and size. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:131-138 [Journal ] Ferran Hurtado , Marc Noy On the number of visibility graphs of simple polygons. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:139-143 [Journal ] Mark Jarvis , Bing Zhou Bounded vertex coloring of trees. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:145-151 [Journal ] Khee Meng Koh , Eng Guan Tay On a conjecture concerning optimal orientations of the cartesian product of a triangle and an odd cycle. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:153-161 [Journal ] Daphne Der-Fen Liu Hamiltonicity and circular distance two labellings. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:163-169 [Journal ] Gregory L. Mayhew Further results on de Bruijn weight classes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:171-173 [Journal ] Behnaz Omoomi , Yee-Hock Peng Chromatic equivalence classes of certain cycles with edges. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:175-183 [Journal ] Martin Sutton , Mirka Miller On the sum number of wheels. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:185-188 [Journal ] Thomas Zaslavsky The largest demigenus of a bipartite signed graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:232, n:1-3, pp:189-193 [Journal ]