The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Douglas Bauer, H. J. Broersma, J. van den Heuvel, Henk Jan Veldman
    Long cycles in graphs with prescribed toughness and minimum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:1-10 [Journal]
  2. Christine Bessenrodt
    Generalisations of the Andrews-Olsson partition identity and applications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:11-22 [Journal]
  3. John L. Blanchard
    An extension theorem for Steiner systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:23-35 [Journal]
  4. Paul A. Catlin, Hong-Jian Lai
    Vertex arboricity and maximum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:37-46 [Journal]
  5. Amanda G. Chetwynd, Susan J. Rhodes
    Chessboard squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:47-59 [Journal]
  6. Nam-Po Chiang, Hung-Lin Fu
    The achromatic indices of the regular complete multipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:61-66 [Journal]
  7. Sheshayya A. Choudum, K. Kayathri
    There are no edge-chromatic 4-critical graphs of order 12. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:67-73 [Journal]
  8. Ernest J. Cockayne, Christina M. Mynhardt
    A characterisation of universal minimal total dominating functions in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:75-84 [Journal]
  9. J. A. Dias da Silva, Amélia Fonseca
    The r-depth of a matroid. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:85-93 [Journal]
  10. Wayne M. Dymàcek, Tom Whaley
    Generating strings for bipartite Steinhaus graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:95-107 [Journal]
  11. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak
    Degree conditions and cycle extendability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:109-122 [Journal]
  12. Miguel Angel Fiol
    On congruence in Zn and the dimension of a multidimensional circulant. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:123-134 [Journal]
  13. Aviezri S. Fraenkel, Martin Loebl
    Complexity of circuit intersection in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:135-151 [Journal]
  14. Gregory Gutin
    Characterizations of vertex pancyclic and pancyclic ordinary complete multipartite digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:153-162 [Journal]
  15. Nora Hartsfield, W. F. Smyth
    A family of sparse graphs of large sum number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:163-171 [Journal]
  16. Anne Joseph
    The isomorphism problem for Cayley digraphs on groups of prime-squared order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:173-183 [Journal]
  17. Emanuel Knill, Andrzej Ehrenfeucht, David Haussler
    The size of k-pseudotrees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:185-194 [Journal]
  18. Vladimir P. Korzhik
    A nonorientable triangular embedding of Kn-K2, n=8 (mod 12). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:195-211 [Journal]
  19. Ruqun Shen, Feng Tian
    Neighborhood unions and hamiltonicity of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:213-225 [Journal]
  20. Jayme Luiz Szwarcfiter
    On edge transitivity of directed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:227-235 [Journal]
  21. Chi Wang
    Boolean minors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:237-258 [Journal]
  22. J. F. Weng, R. S. Booth
    Steiner minimal trees on regular polygons with centre. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:259-274 [Journal]
  23. Xiaomin Bao
    Two new symmetric inseparable double squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:275-277 [Journal]
  24. Anita C. Burris
    The irregular coloring number of a tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:279-283 [Journal]
  25. Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton
    Degree sequence and independence in K(4)-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:285-290 [Journal]
  26. Cuiqin Lin, Guanzhang Hu, Zhongfu Zhang
    A six-color theorem for the edge-face coloring of plane graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:291-297 [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