The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Journals in DBLP

Discrete Mathematics
2004, volume: 285, number: 1-3

  1. Vladimir E. Alekseev, Dmitry V. Korobitsyn, Vadim V. Lozin
    Boundary classes of graphs for the dominating set problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:1-6 [Journal]
  2. Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov
    Tight bounds on maximal and maximum matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:7-15 [Journal]
  3. Béla Bollobás, Vladimir Nikiforov
    Hermitian matrices and graphs: singular values and discrepancy. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:17-32 [Journal]
  4. Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski
    The k-fractal of a simplicial complex. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:33-45 [Journal]
  5. Xiang En Chen
    On the largest eigenvalues of trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:47-55 [Journal]
  6. Kinkar Ch. Das
    Maximizing the sum of the squares of the degrees of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:57-66 [Journal]
  7. Tomislav Doslic, Dragutin Svrtan, Darko Veljan
    Enumerative aspects of secondary structures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:67-82 [Journal]
  8. Luisa Gargano, Mikael Hammar, Pavol Hell, Ladislav Stacho, Ugo Vaccaro
    Spanning spiders and light-splitting switches. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:83-95 [Journal]
  9. Gennian Ge, Alan C. H. Ling
    Group divisible designs with block size four and group type gum1 for small g. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:97-120 [Journal]
  10. Mike J. Grannell, Vladimir P. Korzhik
    Nonorientable biembeddings of Steiner triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:121-126 [Journal]
  11. Toru Hasunuma, Yosuke Kikuchi, Takeshi Mori, Yukio Shibata
    On the number of cycles in generalized Kautz digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:127-140 [Journal]
  12. Fred B. Holt
    Blending simple polytopes at faces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:141-150 [Journal]
  13. Max I. Kanovich
    Finding direct partition bijections by two-directional rewriting techniques. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:151-166 [Journal]
  14. Manoel Lemos
    Elements belonging to triads in 3-connected matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:167-181 [Journal]
  15. Mirko Lepovic
    On integral graphs which belong to the class alphaKa cup betaKb, b. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:183-190 [Journal]
  16. Dan Levy
    Injectivity and surjectivity of Collatz functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:191-199 [Journal]
  17. Eunice Gogo Mphako
    H-lifts of tangential k-blocks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:201-210 [Journal]
  18. Atsuhiro Nakamoto, Seiya Negami, Katsuhiro Ota
    Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:211-218 [Journal]
  19. M. I. Ostrovskii
    Minimal congestion trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:219-226 [Journal]
  20. Christian Peters, Lutz Volkmann
    Vertex 6-pancyclic in-tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:227-238 [Journal]
  21. Norbert Polat
    Fixed finite subgraph theorems in infinite weakly modular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:239-256 [Journal]
  22. Matej Stehlík
    A generalisation of matching and colouring. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:257-265 [Journal]
  23. Lutz Volkmann, Stefan Winzen
    Almost regular multipartite tournaments containing a Hamiltonian path through a given arc. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:267-278 [Journal]
  24. Liming Xiong, Hajo Broersma, Xueliang Li, MingChu Li
    The hamiltonian index of a graph and its branch-bonds. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:279-288 [Journal]
  25. Paul Thomas Young
    Degenerate and n-adic versions of Kummer's congruences for values of Bernoulli polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:289-296 [Journal]
  26. Robert E. L. Aldred, Carsten Thomassen
    Graphs with not all possible path-kernels. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:297-300 [Journal]
  27. Abraham Flaxman
    A sharp threshold for a random constraint satisfaction problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:301-305 [Journal]
  28. Tatsuya Fujisaki
    A construction of amorphous association scheme from a pseudo-cyclic association scheme. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:307-311 [Journal]
  29. Hortensia Galeana-Sánchez, Rocío Rojas-Monroy
    On monochromatic paths and monochromatic 4-cycles in edge coloured bipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:313-318 [Journal]
  30. Pavol Hell, Juan José Montellano-Ballesteros
    Polychromatic cliques. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:319-322 [Journal]
  31. Marcel Herzog, Gil Kaplan, Arieh Lev
    Representation of permutations as products of two cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:323-327 [Journal]
  32. Juha Honkala, Michel Rigo
    Decidability questions related to abstract numeration systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:329-333 [Journal]
  33. Daphne Der-Fen Liu
    Circular chromatic number for iterated Mycielski graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:335-340 [Journal]
  34. Haicheng Ma, Haizhen Ren
    sigma-polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:341-344 [Journal]
  35. Nicolas Sendrier
    Linear codes with complementary duals meet the Gilbert-Varshamov bound. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:345-347 [Journal]
  36. John M. Talbot
    A new Bollobás-type inequality and applications to t-intersecting families of sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:349-353 [Journal]
  37. Ioan Tomescu
    Sunflower hypergraphs are chromatically unique. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:355-357 [Journal]
  38. Lutz Volkmann
    Hamiltonian paths containing a given arc, in almost regular bipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:285, n:1-3, pp:359-364 [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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002