The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1996, volume: 151, number: 1-3

  1. Norman F. Quimpo, Mari-Jo P. Ruiz
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:1-2 [Journal]
  2. Nirmala Achuthan, N. R. Achuthan, Lou Caccetta
    On mixed ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:3-13 [Journal]
  3. Jin Akiyama, Y. Ishigami, Masatsugu Urabe, Jorge Urrutia
    On circles containing the maximum number of points. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:15-18 [Journal]
  4. Brian Alspach, C. C. Chen, Kevin McAvaney
    On a class of Hamiltonian laceable 3-regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:19-38 [Journal]
  5. Kiyoshi Ando, Atsushi Kaneko
    A remark on the connectivity of the complement of a 3-connected graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:39-47 [Journal]
  6. Esperanza Blancaflor Arugay, Severino V. Gervacio
    On path-chromatically unique graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:49-53 [Journal]
  7. Jose Maria P. Balmaceda
    A note on multiplicity-free permutation characters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:55-58 [Journal]
  8. Claude Berge
    Combinatorial games on a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:59-65 [Journal]
  9. Jose M. Bernaldez
    On k-complementing permutations of cyclically k-complementary graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:67-70 [Journal]
  10. Chai-Ling Deng, Chong-Keang Lim
    A characterization of graphs G with G~K2(G). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:71-79 [Journal]
  11. Ding-Zhu Du, D. Frank Hsu, Yuh-Dauh Lyuu
    On the diameter vulnerability of Kautz digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:81-85 [Journal]
  12. Yoshimi Egawa, Mikio Kano
    Sufficient conditions for graphs to have (g, f)-factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:87-90 [Journal]
  13. Severino V. Gervacio
    Trees with diameter less than 5 and non-singular complement. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:91-97 [Journal]
  14. Kiyoshi Hosono, Masatsugu Urabe, Mamoru Watanabe
    Topics on line segments and polygons. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:99-104 [Journal]
  15. Noboru Ito
    Even tournaments and Hadamard tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:105-111 [Journal]
  16. Mikio Kano
    Edge-removing games of star type. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:113-119 [Journal]
  17. K. M. Koh, K. S. Poh
    On the lower length of the closed-set lattice of a tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:121-130 [Journal]
  18. Monique Laurent
    Graphic vertices of the metric polytope. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:131-153 [Journal]
  19. Ko-Wei Lih, Pou-Lin Wu
    On equitable coloring of bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:155-160 [Journal]
  20. Chong-Keang Lim, Kah Seng Lam
    The characteristic polynomial of ladder digraph and an annihilating uniqueness theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:161-167 [Journal]
  21. J. W. Moon
    On the total distance between nodes in tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:169-174 [Journal]
  22. Christine M. O'Keefe
    Ovoids in PG(3, q): a survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:175-188 [Journal]
  23. Christine M. O'Keefe, Arlene A. Pascasio
    Images of conics under derivation. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:189-199 [Journal]
  24. Cheryl E. Praeger, Blessilda P. Raposa
    Non-symmetric nearly triply regular designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:201-212 [Journal]
  25. Helen M. Rara
    Reduction procedures for calculating the determinant of the adjacency matrix of some graphs and the singularity of square planar grids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:213-219 [Journal]
  26. Sze-Chin Shee, Yong-Song Ho
    The cordiality of the path-union of n copies of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:221-229 [Journal]
  27. Ngo Dac Tan
    On the isomorphism problem for a family of cubic metacirculant graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:151, n:1-3, pp:231-242 [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