The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2006, volume: 306, number: 10-11

  1. Peter L. Hammer
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:851-852 [Journal]
  2. Paul Erdös, A. Meir, Vera T. Sós, P. Turán
    On some applications of graph theory, I. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:853-866 [Journal]
  3. László Lovász
    Normal hypergraphs and the perfect graph conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:867-875 [Journal]
  4. Haim Hanani, Dwijendra K. Ray-Chaudhuri, Richard M. Wilson
    On resolvable designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:876-885 [Journal]
  5. Vasek Chvátal
    Edmonds polytopes and a hierarchy of combinatorial problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:886-904 [Journal]
  6. Richard P. Stanley
    Acyclic orientations of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:905-909 [Journal]
  7. Vasek Chvátal
    Tough graphs and hamiltonian circuits. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:910-917 [Journal]
  8. László Babai
    Automorphism groups of graphs and edge-contraction. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:918-922 [Journal]
  9. Paul Erdös, Daniel J. Kleitman
    Extremal problems among subsets of a set. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:923-931 [Journal]
  10. W. T. Tutte
    Spanning subgraphs with specified valencies. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:932-938 [Journal]
  11. Andries E. Brouwer, Alexander Schrijver, Haim Hanani
    Group divisible designs with block-size four. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:939-947 [Journal]
  12. Béla Bollobás, Andrew Thomason
    Set colourings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:948-952 [Journal]
  13. Oleg V. Borodin
    On acyclic colorings of planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:953-972 [Journal]
  14. Alexander Schrijver, Paul D. Seymour
    Solution of two fractional packing problems of Lovász. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:973-978 [Journal]
  15. Paul D. Seymour
    Disjoint paths in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:979-991 [Journal]
  16. Philippe Flajolet
    Combinatorial aspects of continued fractions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:992-1021 [Journal]
  17. Ira M. Gessel
    A q-analog of the exponential formula. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:1022-1031 [Journal]
  18. János Komlós, Endre Szemerédi
    Limit distribution for the existence of Hamiltonian cycles in a random graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:1032-1038 [Journal]
  19. Doron Zeilberger, David M. Bressoud
    A proof of Andrews' q-Dyson conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:1039-1059 [Journal]
  20. Luc Teirlinck
    Non-trivial t-designs without repeated blocks exist for all t. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:1060-1067 [Journal]
  21. Noga Alon, Fan R. K. Chung
    Explicit construction of linear sized tolerant networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:1068-1071 [Journal]
  22. Doron Zeilberger
    A fast algorithm for proving terminating hypergeometric identities. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:1072-1075 [Journal]
  23. Margit Voigt
    List colourings of planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:1076-1079 [Journal]
  24. Sergey Fomin, Curtis Greene
    Noncommutative Schur functions and their applications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:1080-1096 [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