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: 254, number: 1-3

  1. Elisabetta Barletta, Sorin Dragomir
    Combinatorial PDEs on Hamming graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:1-18 [Journal]
  2. Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang
    Balanced k-colorings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:19-32 [Journal]
  3. Thomas A. Carlson
    The edge-isoperimetric problem for discrete tori. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:33-49 [Journal]
  4. Bor-Liang Chen, Kuo-Ching Huang
    On the linear k-arboricity of Kn and Kn, n. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:51-61 [Journal]
  5. Carmen Cortés, Clara I. Grima, Alberto Márquez, Atsuhiro Nakamoto
    Diagonal flips in outer-triangulations on closed surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:63-74 [Journal]
  6. Emeric Deutsch, Marc Noy
    Statistics on non-crossing trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:75-87 [Journal]
  7. Guoli Ding
    On interval clutters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:89-102 [Journal]
  8. Geoffrey Exoo, Alan C. H. Ling, John P. McSorley, Nicholas C. K. Phillips, Walter D. Wallis
    Totally magic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:103-113 [Journal]
  9. Shaun M. Fallat, Steve Kirkland, Sukanta Pati
    Minimizing algebraic connectivity over connected graphs with fixed girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:115-142 [Journal]
  10. Shannon L. Fitzpatrick, Gary MacGillivray, Devon McCrea
    Total domination in complements of graphs containing no K4, 4. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:143-151 [Journal]
  11. Ian P. Goulden, Alexander Yong
    Dyck paths and a bijection for multisets of hook numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:153-164 [Journal]
  12. Fumio Hazama
    On the kernels of the incidence matrices of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:165-174 [Journal]
  13. Michael A. Henning
    Restricted domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:175-189 [Journal]
  14. Iiro S. Honkala, Tero Laihonen, Sanna M. Ranto
    On strongly identifying codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:191-205 [Journal]
  15. Gil Kaplan, Arieh Lev, Yehuda Roditty
    Transitive large sets of disjoint decompositions and group sequencings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:207-219 [Journal]
  16. Martin Kochol
    Equivalences between hamiltonicity and flow conjectures, and the sublinear defect property. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:221-230 [Journal]
  17. Werner Kuich
    Formal series over sorted algebras. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:231-258 [Journal]
  18. Jian-guo Lei
    On large sets of Kirkman systems with holes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:259-274 [Journal]
  19. Xiangwen Li, Bing Wei, Zhengguang Yu, Yongjin Zhu
    Hamilton cycles in 1-tough triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:275-287 [Journal]
  20. Csaba Magyar, Ryan R. Martin
    Tripartite version of the Corrádi-Hajnal theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:289-308 [Journal]
  21. Bernard Mans, Francesco Pappalardi, Igor Shparlinski
    On the spectral Ádám property for circulant graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:309-329 [Journal]
  22. Gregory L. McColm
    MSO zero-one laws on random labelled acyclic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:331-347 [Journal]
  23. Maria Aurora Morgana, Henry Martyn Mulder
    The induced path convexity, betweenness, and svelte graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:349-370 [Journal]
  24. S. R. Nagpaul, S. K. Jain
    Columns of uniform color in a rectangular array with rows having cyclically repeated color patterns. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:371-392 [Journal]
  25. Zhishi Pan, Xuding Zhu
    Tight relation between the circular chromatic number and the girth of series-parallel graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:393-404 [Journal]
  26. Nicholas Pippenger
    Galois theory for minors of finite functions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:405-419 [Journal]
  27. Philippe Pitteloud
    Log-concavity and compressed ideals in certain Macaulay posets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:421-432 [Journal]
  28. Dominique Poulalhon, Gilles Schaeffer
    Factorizations of large cycles in the symmetric group. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:433-458 [Journal]
  29. Helmut Prodinger
    Combinatorics of geometrically distributed random variables: value and position of large left-to-right maxima. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:459-471 [Journal]
  30. Jorge L. Ramírez Alfonsín, David Romero
    Embeddability of the combinohedron. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:473-483 [Journal]
  31. Michel Rigo
    Construction of regular languages and recognizability of polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:485-496 [Journal]
  32. José Plínio O. Santos
    On the combinatorics of polynomial generalizations of Rogers-Ramanujan-type identities. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:497-511 [Journal]
  33. Hao Shen, Jiaying Shen
    Existence of resolvable group divisible designs with block size four I. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:513-525 [Journal]
  34. Konrad J. Swanepoel
    Helly-type theorems for polygonal curves. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:527-537 [Journal]
  35. Lutz Volkmann, Vadim E. Zverovich
    A disproof of Henning's conjecture on irredundance perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:539-554 [Journal]
  36. Jianfang Wang, Haizhu Li
    The upper bound of essential cyclomatic numbers of hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:555-564 [Journal]
  37. Xuebin Zhang
    Incomplete perfect Mendelsohn designs with block size four. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:254, n:1-3, pp:565-597 [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