The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2002, volume: 257, number: 2-3

  1. Lenore Cowen, Jerrold R. Griggs, Douglas B. West
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:191-192 [Journal]
  2. G. W. Peck
    Kleitman and Combinatorics: A Celebration. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:193-224 [Journal]
  3. Michael E. Saks
    Kleitman and combinatorics. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:225-247 [Journal]
  4. Noga Alon
    Covering a hypergraph of subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:249-254 [Journal]
  5. Noga Alon, Tom Bohman, Ron Holzman, Daniel J. Kleitman
    On partitions of discrete boxes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:255-258 [Journal]
  6. Christian Bey, Konrad Engel, Gyula O. H. Katona, Uwe Leck
    On the average size of sets in intersecting Sperner families. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:259-266 [Journal]
  7. Alina Beygelzimer, Stanislaw P. Radziszowski
    On halving line arrangements. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:267-283 [Journal]
  8. Sergei L. Bezrukov, Oriol Serra
    A local-global principle for vertex-isoperimetric problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:285-309 [Journal]
  9. Graham Brightwell, William T. Trotter
    A combinatorial approach to correlation inequalities. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:311-327 [Journal]
  10. Glenn G. Chappell
    Polyunsaturated posets and graphs and the Greene-Kleitman theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:329-340 [Journal]
  11. Fan R. K. Chung, Robert B. Ellis
    A chip-firing game and Dirichlet eigenvalues. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:341-355 [Journal]
  12. Andrzej Czygrinow, Henry A. Kierstead
    2-factors in dense bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:357-369 [Journal]
  13. Ding-Zhu Du, D. Frank Hsu, Hung Quang Ngo, G. W. Peck
    On connectivity of consecutive-d digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:371-384 [Journal]
  14. Zoltán Füredi, András Gyárfás, Miklós Ruszinkó
    On the maximum size of (p, Q)-free families. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:385-403 [Journal]
  15. Wayne Goddard
    4-connected maximal planar graphs are 4-ordered. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:405-410 [Journal]
  16. Jerrold R. Grigg
    Intersecting families with minimum volume. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:411-414 [Journal]
  17. András Gyárfás, André E. Kézdy, Jenö Lehel
    A finite basis characterization of ?-split colorings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:415-421 [Journal]
  18. Peter Hamburger
    Doodles and doilies, non-simple symmetric Venn diagram. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:423-439 [Journal]
  19. Tao Jiang
    Planar Hamiltonian chordal graphs are cycle extendable. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:441-444 [Journal]
  20. Atsushi Kaneko, Kiyoshi Yoshimoto
    On a 2-factor with a specified edge in a graph satisfying the Ore condition. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:445-461 [Journal]
  21. Aleksey D. Korshunov, Ilya Shmulevich
    On the distribution of the number of monotone Boolean functions relative to the number of lower units. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:463-479 [Journal]
  22. Jeffrey C. Lagarias, Joel H. Spencer, Jade P. Vinson
    Counting dyadic equipartitions of the unit square. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:481-499 [Journal]
  23. Mark J. Logan
    Sperner theory in a difference of Boolean lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:501-512 [Journal]
  24. Dhruv Mubayi, Douglas B. West
    On restricted edge-colorings of bicliques. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:513-529 [Journal]
  25. Hans Jürgen Prömel, Thomas Schickinger, Angelika Steger
    A note on triangle-free and bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:531-540 [Journal]
  26. Leonard J. Schulman
    A random stacking process. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:541-547 [Journal]
  27. Vladimir D. Tonchev
    Error-correcting codes from graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:549-557 [Journal]
  28. Jun Wang
    Normalized matching property of the subgroup lattice of an abelian p-group. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:559-574 [Journal]
  29. Herbert S. Wilf
    The patterns of permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:575-583 [Journal]
  30. Elizabeth L. Wilmer, Michael D. Ernst
    Graphs induced by Gray codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:585-598 [Journal]

  31. Research problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:257, n:2-3, pp:599-624 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002