The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1982, volume: 38, number: 2-3

  1. G. Boccara
    Cycles comme produit de deux permutations de classes donnees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:129-142 [Journal]
  2. E. J. Farrell
    Cycle decompositions of complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:143-156 [Journal]
  3. John H. Conway, Vera Pless
    On primes dividing the group order of a doubly-even (72, 36, 16) code and the group order of a quaternary (24, 12, 10) code. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:157-162 [Journal]
  4. Jean-Luc Fouquet
    Note sur la non existence d'un snark d'ordre 16. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:163-171 [Journal]
  5. T. Gangopadhyay
    Characterisation of potentially bipartite self-complementary bipartitioned sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:173-184 [Journal]
  6. Marie-Claude Heydemann
    Cycles in strong oriented graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:185-190 [Journal]
  7. Michael S. Jacobson
    On a generalization of Ramsey theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:191-195 [Journal]
  8. V. Krishnamoorthy, K. R. Parthasarathy
    On the reconstruction of separable graphs from elementary contractions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:197-205 [Journal]
  9. Aldo de Luca
    On some combinatorial problems in free monoids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:207-225 [Journal]
  10. P. A. Picon
    Un résultat d'intégrité. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:227-241 [Journal]
  11. Norbert Polat
    Sous-graphes traçables des graphes infinis. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:243-263 [Journal]
  12. Christiane Poupard
    De nouvelles significations enumeratives des nombres d'entringer. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:265-271 [Journal]
  13. Richard L. Roth
    Color symmetry and group theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:273-296 [Journal]
  14. Alexander Schrijver
    On the number of edge-colourings of regular bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:297-301 [Journal]
  15. Sue Whitesides
    A classification of certain graphs with minimal imperfection properties. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:303-310 [Journal]
  16. Vladimir Batagelj, Tomaz Pisanski
    Hamiltonian cycles in the cartesian product of a tree and a cycle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:311-312 [Journal]
  17. David M. Bressoud, Doron Zeilberger
    A short Rogers-Ramanujan bijection. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:313-315 [Journal]
  18. Alexander K. Kelmans, M. V. Lomonosov
    When m vertices in a k-connected graph cannot be walked round along a simple cycle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:2-3, pp:317-322 [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