The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2005, volume: 297, number: 1-3

  1. Antonio Avilés
    Extensions of Boolean isometries. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:1-12 [Journal]
  2. Richard C. Brewster, Renato Dedic, François Huard, Jeffery Queen
    The recognition of bound quivers using edge-coloured homomorphisms. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:13-25 [Journal]
  3. José Cáceres, Alberto Márquez, Ortrud R. Oellermann, María Luz Puertas
    Rebuilding convex sets in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:26-37 [Journal]
  4. Charles J. Colbourn, Alan C. H. Ling, Gaetano Quattrocchi
    Embedding path designs into kite systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:38-48 [Journal]
  5. Malgorzata Kuchta, Michal Morayne, Jaroslaw Niemiec
    Counting embeddings of a chain into a tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:49-59 [Journal]
  6. James G. Lefevre, Mary Waterhouse
    Some equitably 3-colourable cycle decompositions of complete equipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:60-77 [Journal]
  7. Hajime Matsumura
    Vertex-disjoint 4-cycles containing specified edges in a bipartite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:78-90 [Journal]
  8. Yossi Moshe
    The distribution of elements in automatic double sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:91-103 [Journal]
  9. K. L. Ng, K. M. Koh
    On optimal orientation of cycle vertex multiplications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:104-118 [Journal]
  10. Primoz Potocnik, Martin Skoviera, Riste Skrekovski
    Nowhere-zero 3-flows in abelian Cayley graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:119-127 [Journal]
  11. Ligong Wang, Xueliang Li
    Integral trees with diameters 5 and 6. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:128-143 [Journal]
  12. Thomas Andreae
    Reconstructing the number of blocks of an infinite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:144-151 [Journal]
  13. Yehuda Ashkenazi
    C3 saturated graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:152-158 [Journal]
  14. Bostjan Bresar, Wilfried Imrich, Sandi Klavzar
    Reconstructing subgraph-counting graph polynomials of increasing families of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:159-166 [Journal]
  15. M. M. Jaradat
    On the Anderson-Lipman conjecture and some related problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:167-173 [Journal]
  16. Hyun Kwang Kim, Dong Yeol Oh
    On the nonexistence of triple-error-correcting perfect binary linear codes with a crown poset structure. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:174-181 [Journal]
  17. Terry A. McKee
    Requiring chords in cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:182-189 [Journal]
  18. Gábor N. Sárközy, Stanley M. Selkow
    On a Turán-type hypergraph problem of Brown, Erdos and T. Sós. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:190-195 [Journal]
  19. Svetoslav Savchev, Fang Chen
    Kemnitz' conjecture revisited. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:196-201 [Journal]
  20. Galen E. Turner III
    A generalization of Dirac's theorem: Subdivisions of wheels. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:202-205 [Journal]
  21. Li Zhang, Baoyindureng Wu
    A note on 3-choosability of planar graphs without certain cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:206-209 [Journal]
  22. Philip A. Sinclair
    Erratum to "On removable even circuits in graphs". [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:297, n:1-3, pp:210-213 [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