The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1998, volume: 188, number: 1-3

  1. Rudolf Ahlswede, Z. Zhang
    Code pairs with specified parity of the Hamming distances. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:1-11 [Journal]
  2. Salar Y. Alsardary, Jerzy Wojciechowski
    The basis number of the powers of the complete graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:13-25 [Journal]
  3. Ahmed M. Assaf
    Directed covering with block size 5 and index even. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:27-40 [Journal]
  4. Bhaskar Bagchi, Basudeb Datta
    A structure theorem for pseudomanifolds. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:41-60 [Journal]
  5. Jørgen Bang-Jensen, Gregory Gutin
    Alternating cycles and trails in 2-edge-coloured complete multigraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:61-72 [Journal]
  6. Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena
    On universal graphs for planar oriented graphs of a given girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:73-85 [Journal]
  7. Niall Cairnie, Keith Edwards
    The achromatic number of bounded degree trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:87-97 [Journal]
  8. James A. Davis
    New semiregular divisible difference sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:99-109 [Journal]
  9. A. M. H. Gerards, F. Bruce Shepherd
    Strong orientations without even directed circuits. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:111-125 [Journal]
  10. Masaaki Harada, T. Aaron Gulliver, Hitoshi Kaneta
    Classification of extremal double-circulant self-dual codes of length up to 62. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:127-136 [Journal]
  11. Mirko Lepovic
    On formal products and spectra of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:137-149 [Journal]
  12. MingChu Li
    Vertex pancyclism in claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:151-173 [Journal]
  13. Xueliang Li
    Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:175-182 [Journal]
  14. Eckhard Steffen
    Classifications and characterizations of snarks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:183-203 [Journal]
  15. Stevo Todorcevic
    Countable chain condition in partition calculus. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:205-223 [Journal]
  16. Liming Xiong
    Edge degree conditions for subpancyclicity in line graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:225-232 [Journal]
  17. Beifang Chen, Serge Lawrencenko
    Structural characterization of projective flexibility. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:233-238 [Journal]
  18. Jochen Harant
    A lower bound on the independence number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:239-243 [Journal]
  19. Iliya Bluskov
    Some t-designs are minimal (t + 1)-coverings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:245-251 [Journal]
  20. Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt
    Irredundant and perfect neighbourhood sets in trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:253-260 [Journal]
  21. N. I. Glebov, Alexandr V. Kostochka
    On the independent domination number of graphs with given minimum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:261-266 [Journal]
  22. Olof Heden
    Another Bruen chain. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:267- [Journal]
  23. Xinming Liu, Douglas B. West
    Line digraphs and coreflexive vertex sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:269-277 [Journal]
  24. M. R. Sridharan, K. Balaji
    Characterisation of self-complementary chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:279-283 [Journal]
  25. Litong Xie, Guizhen Liu, Baogang Xu
    On endo-homology of complexes of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:285-291 [Journal]
  26. Likuan Zhao
    The kissing number of the regular polygon. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:293-296 [Journal]
  27. Nedyalko Dimov Nenov
    On the small graphs with chromatic number 5 without 4-cliques. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:297-298 [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