The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1994, volume: 133, number: 1-3

  1. Shreeram S. Abhyankar, Ikkwon Yie
    Small degree coverings of the affine line in characteristic two. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:1-23 [Journal]
  2. Shreeram S. Abhyankar, Jun Ou, Avinash Sathaye
    Alternating group coverings of the affine line for characteristic two. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:25-46 [Journal]
  3. Ahmed M. Assaf
    Bipacking pairs by quintuples: The case nu=13 (mod 20). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:47-54 [Journal]
  4. Frank W. Barnes
    How many 1×2×4 bricks can you get into an odd box? [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:55-78 [Journal]
  5. Luigi Cerlienco, Marina Mureddu
    Generalized Robinson-Schensted correspondences: a new algorithm. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:79-88 [Journal]
  6. Mark N. Ellingham, Robert L. Hemminger, Kathryn E. Johnson
    Contractible edges in longest cycles in non-Hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:89-98 [Journal]
  7. Winfried Geyer
    On Tamari lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:99-122 [Journal]
  8. Robert B. Hughes
    Lower bounds on cube simplexity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:123-138 [Journal]
  9. Alexander V. Ivashchenko
    Some properties of contractible transformations on graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:139-145 [Journal]
  10. Zygmunt Jackowski
    Characterizations of two classes of digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:147-157 [Journal]
  11. Ming Jiang, Frank Ruskey
    Determining the hamilton-connectedness of certain vertex-transitive graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:159-169 [Journal]
  12. Hiroshi Kimura
    Classification of Hadamard matrices of order 28. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:171-180 [Journal]
  13. R. Klein
    On the colorability of m-composed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:181-190 [Journal]
  14. Jan Kratochvíl
    Regular codes in regular graphs are difficult. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:191-205 [Journal]
  15. Eric Mendelsohn, P. Rodney
    The existence of court balanced tournament designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:207-216 [Journal]
  16. David J. Rasmussen, Carla D. Savage
    Hamilto-connected derangement graphs on S n. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:217-223 [Journal]
  17. James H. Schmerl
    Tiling space with notched cubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:225-235 [Journal]
  18. Marcin J. Schroeder
    Dependence systems with the operator-image exchange property. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:237-248 [Journal]
  19. Yongbing Shi
    The number of cycles in a hamilton graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:249-257 [Journal]
  20. B. Uhrin
    The set of neighbours of a set in a point-lattice. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:259-266 [Journal]
  21. Shaoji Xu
    Classes of chromatically equivalent graphs and polygon trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:267-278 [Journal]
  22. Horst Alzer
    An inequality for increasing sequences and its integral analogue. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:279-283 [Journal]
  23. Paul L. Check, Charles J. Colbourn
    Concerning difference families with block size four. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:285-289 [Journal]
  24. D. Frank Hsu, Tomasz Luczak
    On the k-diameter of k-regular k-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:291-296 [Journal]
  25. Sandi Klavzar, Uros Milutinovic
    Strong products of Kneser graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:297-300 [Journal]
  26. Anping Li
    On the conjecture at two counterfeit coins. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:301-306 [Journal]
  27. Hunter S. Snevily
    The snake-in-the-box problem: A new upper bound. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:307-314 [Journal]
  28. Jun-Ming Xu
    A sufficient condition for equality of arc-connectivity and minimum degree of a diagraph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:315-318 [Journal]
  29. Min Song Zeng, Zhang Ke Min
    Neighborhood unions and Hamiltonian properties. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:319-324 [Journal]
  30. Ke Min Zhang, Yannis Manoussakis, Zeng Min Song
    Complementary cycles containing a fixed arc in diregular bipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:133, n:1-3, pp:325-328 [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