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

Journals in DBLP

Discrete Mathematics
1988, volume: 72, number: 1-3

  1. Jin Akiyama, Yoshimi Egawa, Hikoe Enomoto
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:1-2 [Journal]
  2. Yousef Alavi, Fred Buckley, Marc Shamula, Sergio Ruiz
    Highly irregular m-chromatic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:3-13 [Journal]
  3. Noga Alon, Fan R. K. Chung
    Explicit construction of linear sized tolerant networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:15-19 [Journal]
  4. Béla Bollobás
    Sorting in rounds. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:21-28 [Journal]
  5. C. C. Chen
    On edge-Hamiltonian property of Cayley graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:29-33 [Journal]
  6. Ernest J. Cockayne, Stephen T. Hedetniemi, Renu Laskar
    Gallai theorems for graphs, hypergraphs, and set systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:35-47 [Journal]
  7. Charles J. Colbourn
    Edge-packing of graphs and network reliability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:49-61 [Journal]
  8. Italo J. Dejter, J. Cordova, J. A. Quintana
    Two hamilton cycles in bipartite reflective kneser graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:63-70 [Journal]
  9. Chai-Ling Deng, Chong-Keang Lim
    A result on generalized latin rectangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:71-80 [Journal]
  10. Paul Erdös
    Problems and results in combinatorial analysis and graph theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:81-92 [Journal]
  11. Paul Erdös, Ralph J. Faudree, Edward T. Ordman
    Clique partitions and clique coverings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:93-101 [Journal]
  12. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Extremal theory and bipartite graph-tree Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:103-112 [Journal]
  13. Siemion Fajtlowicz
    On conjectures of Graffiti. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:113-118 [Journal]
  14. Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Small order graph-tree Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:119-127 [Journal]
  15. L. R. Foulds, R. W. Robinson
    Enumerating phylogenetic trees with multiple labels. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:129-139 [Journal]
  16. Ove Frank
    Triad count statistics. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:141-149 [Journal]
  17. Severino V. Gervacio
    Score sequences: Lexicographic enumeration and tournament construction. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:151-155 [Journal]
  18. Jerrold R. Griggs
    Problems on chain partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:157-162 [Journal]
  19. Yahya Ould Hamidoune, Michel Las Vergnas
    A solution to the Misère Shannon switching Game. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:163-166 [Journal]
  20. Takayuki Hibi, Hiroshi Narushima, Morimasa Tsuchiya, Kei-ichi Watanabe
    A graph-theoretical characterization of the order complexes on the 2-sphere. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:167-174 [Journal]
  21. Cornelis Hoede
    Hard graphs for the maximum clique problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:175-179 [Journal]
  22. Noboru Ito
    Doubly regular asymmetric digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:181-185 [Journal]
  23. Yoji Kajitani, Shuichi Ueno, Hiroshi Miyano
    Ordering of the elements of a matroid such that its consecutive w elements are independent. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:187-194 [Journal]
  24. Fumio Kitagawa, Hideto Ikeda
    An existential problem of a weight- controlled subset and its application to school timetable construction. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:195-211 [Journal]
  25. W. L. Kocay, Zeke Ming Lui
    More non-reconstructible hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:213-224 [Journal]
  26. K. M. Koh, K. S. Poh
    Constructions of sensitive graphs which are not strongly sensitive. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:225-236 [Journal]
  27. Pierre Leroux, Xavier Gérard Viennot
    Combinatorial resolution of systems of differential equations. IV. separation of variables. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:237-250 [Journal]
  28. Feodor Loupekine, John J. Watkins
    Labeling angles of planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:251-256 [Journal]
  29. Tomasz Luczak, Zbigniew Palka
    Maximal induced trees in sparse random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:257-265 [Journal]
  30. W. Mader
    Generalizations of critical connectivity of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:267-283 [Journal]
  31. Hiroshi Maehara
    On the euclidean dimension of a complete multipartite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:285-289 [Journal]
  32. Izumi Miyamoto
    Computation of some Cayley diagrams. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:291-293 [Journal]
  33. Tsuyoshi Nishimura
    Short cycles in digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:295-298 [Journal]
  34. Krzysztof Nowicki, John C. Wierman
    Subgraph counts in random graphs using incomplete u-statistics methods. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:299-310 [Journal]
  35. Michael D. Plummer
    Toughness and matching extension in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:311-320 [Journal]
  36. K. B. Reid
    Bipartite graphs obtained from adjacency matrices of orientations of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:321-330 [Journal]
  37. Mari-Jo P. Ruiz
    Cn-factors of group graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:331-336 [Journal]
  38. Maciej M. Syslo
    An algorithm for solving the jump number problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:337-346 [Journal]
  39. Hoon heng Teh, Meng Fang Foo
    Large scale network analysis with applications to transportation, communication and inference networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:347-353 [Journal]
  40. Shuichi Ueno, Yoji Kajitani, Shin'ya Gotoh
    On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:355-360 [Journal]
  41. Kazuhiko Ushio
    P3-Factorization of complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:361-366 [Journal]
  42. Andrew Vince
    n-Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:367-380 [Journal]
  43. Jianfang Wang
    On point-linear arboricity of planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:381-384 [Journal]
  44. Toshihiro Watanabe
    On the Littlewood-Richardson rule in terms of lattice path combinatorics. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:385-390 [Journal]
  45. Earl Glen Whitehead Jr.
    Chromatic polynomials of generalized trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:391-393 [Journal]
  46. H. P. Yap
    Packing of graphs - a survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:395-404 [Journal]
  47. Zhang Fu-ji, Guo Xiao-feng, Chen Rong-si
    Z-transformation graphs of perfect matchings of hexagonal systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:405-415 [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