The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1995, volume: 147, number: 1-3

  1. K. T. Arasu, Dieter Jungnickel, Siu Lun Ma, Alexander Pott
    Relative difference sets with n = 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:1-17 [Journal]
  2. Francisco Barahona, Ali Ridha Mahjoub
    On two-connected subgraph polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:19-34 [Journal]
  3. Tony L. Brewster, Michael J. Dinneen, Vance Faber
    A computational attack on the conjectures of Graffiti: New counterexamples and proofs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:35-55 [Journal]
  4. Richard A. Brualdi, Janine Smolin Graves, K. Mark Lawrence
    Codes with a poset metric. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:57-72 [Journal]
  5. Gary Chartrand, Heather Gavlas, Michelle Schultz
    Convergent sequences of iterated H-line graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:73-86 [Journal]
  6. Edward Dobson
    Isomorphism problem for Cayley graphs of Zp3. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:87-94 [Journal]
  7. Paul H. Edelman
    Lexicographically first reduced words. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:95-106 [Journal]
  8. Alexander V. Evako
    Topological properties of the intersection graph of covers of n-dimensional surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:107-120 [Journal]
  9. Susanna Fishel
    Nonnegativity results for generalized q-binomial coefficients. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:121-137 [Journal]
  10. Lorenz Halbeisen, Norbert Hungerbühler
    The general counterfeit coin problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:139-150 [Journal]
  11. David Hartvigsen
    Generalizing the all-pairs min cut problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:151-169 [Journal]
  12. K. M. Koh, B. P. Tan
    Kings in multipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:171-183 [Journal]
  13. K. B. Reid, Weizhen Gu
    Plurality preference digraphs realized by trees - I. Necessary and sufficient conditions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:185-196 [Journal]
  14. Frank Rhodes
    Metric subgraphs of the chamfer metrics and the Melter-Tomescu path generated metrics. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:197-209 [Journal]
  15. Petr Savický
    Bent functions and random boolean formulas. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:211-234 [Journal]
  16. Malay K. Sen, B. K. Sanyal, Douglas B. West
    Representing digraphs using intervals or circular arcs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:235-245 [Journal]
  17. E. C. Sewell, L. E. Trotter
    Stability critical graphs and ranks facets of the stable set polytope. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:247-255 [Journal]
  18. Weifan Wang
    On the colorings of outerplanar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:257-269 [Journal]
  19. Qingchuan Zhu
    The largest transversal numbers of uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:271-282 [Journal]
  20. Manoj K. Chari
    Matroid inequalities. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:283-286 [Journal]
  21. Virgil Domocos, S. N. Buzeteanu
    The generating function of irreducible coverings by edges of complete k-partite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:287-292 [Journal]
  22. Ronald D. Dutton, Robert C. Brigham
    On the radius and diameter of the clique graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:293-295 [Journal]
  23. Gary Gordon, Eleanor McDonnell
    Trees with the same degree sequence and path numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:297-300 [Journal]
  24. Jochen Harant, Peter J. Owens
    Non-hamiltonian 4/5-tough maximal planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:301-305 [Journal]
  25. K. Nomura
    A remark on Mulder's conjecture about interval-regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:307-311 [Journal]
  26. Gábor Révész, Jenö Szigeti
    Eulerian trace identities. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:313-319 [Journal]
  27. Jinjiang Yuan
    A local reductive elimination for the fill-in of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:321-327 [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