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

Journals in DBLP

Discrete Mathematics
2002, volume: 259, number: 1-3

  1. Sergei A. Abramov, Ha Q. Le
    A criterion for the applicability of Zeilberger's algorithm to rational functions . [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:1-17 [Journal]
  2. Mike D. Atkinson, Timothy Stitt
    Restricted permutations and the wreath product. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:19-36 [Journal]
  3. Norman Biggs
    Equimodular curves. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:37-57 [Journal]
  4. Jeffrey A. Boyle
    Thresholds for random distributions on graph sequences with applications to pebbling. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:59-69 [Journal]
  5. Yves Chiricota
    Application des fonctions symétriques à la résolution d'équations différentielles autonomes combinatoires. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:71-90 [Journal]
  6. Ryoh Fuji-Hara, Sanpei Kageyama, Shinya Kuriki, Ying Miao, Shigenobu Shinohara
    Balanced nested designs and balanced arrays. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:91-119 [Journal]
  7. Hortensia Galeana-Sánchez
    Kernels in digraphs with covering number at most 3. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:121-135 [Journal]
  8. Joseph Douglas Horton, Walter D. Wallis
    Factoring the cartesian product of a cubic graph and a triangle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:137-146 [Journal]
  9. Braulio Maia Jr.
    Connected matroids with a small circumference. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:147-161 [Journal]
  10. Emanuele Munarini, Norma Zagaglia Salvi
    On the rank polynomial of the lattice of order ideals of fences and crowns. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:163-177 [Journal]
  11. Ivano Pinneri
    Searching for semifield flocks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:179-188 [Journal]
  12. Pedro V. Silva
    The homomorphism problem for the free monoid. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:189-200 [Journal]
  13. Ernesto Vallejo
    A characterization of additive sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:201-210 [Journal]
  14. Hanumappa B. Walikar, Fred Buckley, M. K. Itagi
    Diameter-essential edges in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:211-225 [Journal]
  15. Lianzhu Zhang, Feng Tian
    Independence and connectivity in 3-domination-critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:227-236 [Journal]
  16. Jovisa D. Zunic
    Extremal problems on convex lattice polygons in sense of lp-metrics. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:237-250 [Journal]
  17. Sukumar Das Adhikari, Yong-Gao Chen
    On a question regarding visibility of lattice points--III. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:251-256 [Journal]
  18. Gábor Bacsó, Odile Favaron
    Independence, irredundance, degrees and chromatic number in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:257-262 [Journal]
  19. Darryn E. Bryant, Hung-Lin Fu
    C4-saturated bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:263-268 [Journal]
  20. Janka Chlebíková
    Partial k-trees with maximum chromatic number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:269-276 [Journal]
  21. James D. Currie
    No iterated morphism generates any Arshon sequence of odd order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:277-283 [Journal]
  22. Daniel B. Dalan
    Type I neighbors of extremal type II codes of length 40 derived from Hadamard matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:285-291 [Journal]
  23. Charles Delorme, Odile Favaron, Dieter Rautenbach
    On the reconstruction of the degree sequence. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:293-300 [Journal]
  24. Beiliang Du, Jian Wang
    Kl, k-factorization of complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:301-306 [Journal]
  25. Herbert Fleischner, Martin Kochol
    A note about the dominating circuit conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:307-309 [Journal]
  26. John P. Georges, David W. Mauro
    On generalized Petersen graphs labeled with a condition at distance two. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:311-318 [Journal]
  27. Tsuyoshi Nishimura
    A closure concept in factor-critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:319-324 [Journal]
  28. Dieter Rautenbach, Lutz Volkmann
    Independent domination and matchings in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:325-330 [Journal]
  29. Dieter Rautenbach, Eberhard Triesch
    Reconstruction up to isometries. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:331-336 [Journal]
  30. Romeo Rizzi
    Cycle cover property and CPP=SCC property are not equivalent. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:337-342 [Journal]
  31. G. Sethuraman, P. Selvaraju
    One edge union of shell graphs and one vertex union of complete bipartite graphs are cordial. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:343-350 [Journal]
  32. Man-Keung Siu, Zhongfu Zhang, Sanming Zhou
    An inequality between the diameter and the inverse dual degree of a tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:351-358 [Journal]
  33. Carsten Thomassen
    An intersection graph of straight lines. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:359-360 [Journal]
  34. Mitsunori Togasaki, Koichi Yamazaki
    Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:361-368 [Journal]
  35. Chengfu Ye, Nianzu Li
    Graphs with chromatic polynomial sum(...). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:369-381 [Journal]
  36. Walter Wenzel
    A sufficient condition for a bipartite graph to be a cube. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:383-386 [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