The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2005, volume: 290, number: 2/3

  1. Dan Archdeacon, Marisa Debowsky
    A characterization of projective-planar signed graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:109-116 [Journal]
  2. Manoj Changat, Henry Martyn Mulder, Gerard Sierksma
    Convexities related to path properties on graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:117-131 [Journal]
  3. Gary Chartrand, Ladislav Nebesky, Ping Zhang
    On hamiltonian colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:133-143 [Journal]
  4. Mei-Ju Chen, David Kuo, Jing-Ho Yan
    The bandwidth sum of join and composition of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:145-163 [Journal]
  5. David J. Grynkiewicz
    On four color monochromatic sets with nondecreasing diameter. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:165-171 [Journal]
  6. Frank Harary, Desh Ranjan
    Identity orientation of complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:173-182 [Journal]
  7. Hervé Kerivin, Ali Ridha Mahjoub
    On survivable network polyhedra. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:183-210 [Journal]
  8. Hao Li, Jinlong Shu
    The partition of a strong tournament. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:211-220 [Journal]
  9. Horst Martini, Valeriu Soltan
    Antipodality properties of finite sets in Euclidean space. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:221-228 [Journal]
  10. Michael S. Roddy, Bernd S. W. Schröder
    Isotone relations revisited. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:229-248 [Journal]
  11. B. P. Tan
    On the kings and kings-of-kings in semicomplete multipartite digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:249-258 [Journal]
  12. Yasuo Teranishi
    The number of spanning forests of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:259-267 [Journal]
  13. Alexei N. Glebov, Alexandr V. Kostochka, Vladimir A. Tashkinov
    Smaller planar triangle-free graphs that are not 3-list-colorable. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:269-274 [Journal]
  14. H. L. Abbott, D. R. Hare
    The set of values of b for which there exist block designs with b blocks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:275-282 [Journal]
  15. Yan Liu
    Characterizations of maximum matching graphs of certain types. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:283-289 [Journal]
  16. Lorenzo Traldi
    Parallel connections and coloured Tutte polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:291-299 [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