The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2002, volume: 256, number: 1-2

  1. R. Julian R. Abel, Ahmed M. Assaf
    Modified group divisible designs with block size 5 and lambda=1. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:1-22 [Journal]
  2. Noga Alon, József Balogh, Béla Bollobás, Tamás Szabó
    Game domination number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:23-33 [Journal]
  3. Curtis A. Barefoot
    Block-cutvertex trees and block-cutvertex partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:35-54 [Journal]
  4. Nicholas J. Cavenagh
    Further decompositions of complete tripartite graphs into 5-cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:55-81 [Journal]
  5. David Coulson
    A 15-colouring of 3-space omitting distance one. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:83-90 [Journal]
  6. Ajit A. Diwan, Manish P. Kurhekar
    Plane triangulations are 6-partitionable. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:91-103 [Journal]
  7. Igor Fabrici
    On vertex-degree restricted subgraphs in polyhedral graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:105-114 [Journal]
  8. Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley
    Total irredundance in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:115-127 [Journal]
  9. Peter C. Fishburn, William T. Trotter
    Containment orders for similar ellipses with a common center. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:129-136 [Journal]
  10. Alan M. Frieze, Michael Krivelevich
    Hamilton cycles in random subgraphs of pseudo-random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:137-150 [Journal]
  11. Ronald J. Gould, Florian Pfender
    Pancyclicity in claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:151-160 [Journal]
  12. Wolfgang Haas
    Binary and ternary codes of covering radius one: some new lower bounds. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:161-178 [Journal]
  13. Gena Hahn, Jan Kratochvíl, Jozef Sirán, Dominique Sotteau
    On the injective chromatic number of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:179-192 [Journal]
  14. Jochen Harant, Zdenek Ryjácek, Ingo Schiermeyer
    Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:193-201 [Journal]
  15. Anthony J. W. Hilton, H. R. Hind
    Non-conformable subgraphs of non-conformable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:203-224 [Journal]
  16. Matthew D. Kearse, Peter B. Gibbons
    A new lower bound on upper irredundance in the queens' graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:225-242 [Journal]
  17. Ayman Khalfalah, Sachin Lodha, Endre Szemerédi
    Tight bound for the density of sequence of integers the sum of no two of which is a perfect square. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:243-255 [Journal]
  18. Dongju Kim, Daekeun Lim
    2-connected and 2-edge-connected Steinhaus graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:257-265 [Journal]
  19. Mekkia Kouider, Maryvonne Mahéo
    Some bounds for the b-chromatic number of a grap. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:267-277 [Journal]
  20. Bruce M. Landman, Aaron Robertson
    On generalized van der Waerden triples. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:279-290 [Journal]
  21. Sungchul Lee
    Worst case asymptotics of power-weighted Euclidean functionals. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:291-300 [Journal]
  22. Cai Heng Li
    On isomorphisms of finite Cayley graphs--a survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:301-334 [Journal]
  23. Hirobumi Mizuno, Iwao Sato
    L-functions for images of graph coverings by some operations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:335-347 [Journal]
  24. Michael Molloy, Laura Sedgwick
    Isomorphism certificates for undirected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:349-359 [Journal]
  25. Blanca Rosa Pérez-Salvador, Sergio de-los-Cobos-Silva, Miguel Angel Gutiérrez-Ándrade, Adolfo Torres-Chazaro
    A reduced formula for the precise number of (0, 1)-matrices in A(R, S). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:361-372 [Journal]
  26. Burkard Polster
    Centering small generalized polygons-projective pottery at work. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:373-386 [Journal]
  27. Yonutz Stanchescu
    Planar sets containing no three collinear points and non-averaging sets of integers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:387-395 [Journal]
  28. Shu-Dong Wang, Dong-Ling Chen, Shan-Chen Pang
    The incidence coloring number of Halin graphs and outerplanar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:397-405 [Journal]
  29. Liming Xiong, Zhanhong Liu
    Hamiltonian iterated line graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:407-422 [Journal]
  30. József Balogh, András Pluhár
    The interval number of dense graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:423-429 [Journal]
  31. Paul S. Bonsma, Nicola Ueffing, Lutz Volkmann
    Edge-cuts leaving components of order at least three. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:431-439 [Journal]
  32. Gerard J. Chang, Li-Da Tong, Jing-Ho Yan, Hong-Gwa Yeh
    A note on the Gallai-Roy-Vitaver Theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:441-444 [Journal]
  33. Vasek Chvátal, Irena Rusu, R. Sritharan
    Dirac-type characterizations of graphs without long chordless cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:445-448 [Journal]
  34. Alina Copeland, Frank W. Schmidt, Rodica Simion
    On two determinants with interesting factorizations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:449-458 [Journal]
  35. Ales Drápal
    Yet another approach to the extended ternary Golay code. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:459-464 [Journal]
  36. Nicholas Hamilton
    Strongly regular graphs from differences of quadrics. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:465-469 [Journal]
  37. Masaaki Harada, Patric R. J. Östergård
    Self-dual and maximal self-orthogonal codes over F7. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:471-477 [Journal]
  38. Olof Heden
    On the reconstruction of perfect codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:479-485 [Journal]
  39. Lih-Hsing Hsu
    A note on the ultimate categorical matching in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:487-488 [Journal]
  40. Ilia Krasikov, Arieh Lev, Bhalchandra D. Thatte
    Upper bounds on the automorphism group of a graph0. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:489-493 [Journal]
  41. Gregory L. Mayhew
    Extreme weight classes of de Bruijn sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:495-497 [Journal]
  42. Oren Nechushtan
    On the space chromatic number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:499-507 [Journal]
  43. Ofer Shafir
    Universal graphs without large bipartite graphs assuming GCH. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:509-512 [Journal]
  44. Richard Stong
    Orthogonal Matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:513-518 [Journal]
  45. Chunxiang Wang, Jingzhong Mao
    A proof of a conjecture of minus domination in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:519-521 [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