The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1999, volume: 197, number:

  1. H. L. Abbott, D. R. Hare
    Square critically 3-chromatic hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:3-13 [Journal]
  2. F. Aguiló-Gost
    New dense families of triple loop networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:15-27 [Journal]
  3. Robert E. L. Aldred, Michael D. Plummer
    On matching extensions with prescribed and proscribed edge sets II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:29-40 [Journal]
  4. Ian Anderson
    On the construction of balanced room squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:53-60 [Journal]
  5. Camino Balbuena, Angeles Carmona, Josep Fàbrega, Miguel Angel Fiol
    Superconnectivity of bipartite digraphs and graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:61-75 [Journal]
  6. David Bedford, Roger M. Whitaker
    Enumeration of transversals in the Cayley tables of the non-cyclic groups of order 8. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:77-81 [Journal]
  7. Anton Betten, Mikhail H. Klin, Reinhard Laue, Alfred Wassermann
    Graphical t-designs via polynomial Kramer-Mesner matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:83-109 [Journal]
  8. Anton Betten, Reinhard Laue, Alfred Wassermann
    New t-designs and large sets of t-designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:111-121 [Journal]
  9. Elizabeth J. Billington
    Decomposing complete tripartite graphs into cycles of lengths 3 and 4. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:123-135 [Journal]
  10. Aart Blokhuis, Christine M. O'Keefe
    On deriving unitals. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:137-141 [Journal]
  11. Jan Brousek, Zdenek Ryjácek, Ingo Schiermeyer
    Forbidden subgraphs, stability and hamiltonicity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:143-155 [Journal]
  12. Josep M. Brunat, Montserrat Maureso, M. Mora
    Endo-circulant digraphs: connectivity and generalized cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:157-167 [Journal]
  13. Gerard J. Chang, Min-Jen Jou
    The number of maximal independent sets in connected triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:169-178 [Journal]
  14. Gary Chartrand, Frank Harary, Bill Quan Yue
    On the out-domination and in-domination numbers of a digraph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:179-183 [Journal]
  15. Guantao Chen, Ronald J. Gould, Michael S. Jacobson
    On 2-factors containing 1-factors in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:185-194 [Journal]
  16. Chao-Chih Chou, Chin-Mei Fu, Wen-Chung Huang
    Decomposition of Km, n into short cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:195-203 [Journal]
  17. Brian Curtin
    Distance-regular graphs which support a spin model are thin. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:205-216 [Journal]
  18. David P. Day, Ortrud R. Oellermann, Henda C. Swart
    Bounds on the size of graphs of given order and up/down-connectivity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:217-223 [Journal]
  19. Yoshimi Egawa, Katsuhiro Ota
    Vertex-disjoint claws in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:225-246 [Journal]
  20. Sergei Evdokimov, Marek Karpinski, Ilia N. Ponomarenko
    Compact cellular algebras and permutation groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:247-267 [Journal]
  21. Odile Favaron, Joël Puech
    Irredundant and perfect neighborhood sets in graphs and claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:269-284 [Journal]
  22. Daniela Ferrero, Carles Padró
    Disjoint paths of bounded length in large generalized cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:285-298 [Journal]
  23. Norman J. Finizio, Philip A. Leonard
    Inductive extensions of some Z-cyclic whist tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:299-307 [Journal]
  24. Eldar Fischer
    Cycle factors in dense graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:309-323 [Journal]
  25. Willem L. Fouché
    Symmetries and Ramsey properties of trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:325-330 [Journal]
  26. Willem L. Fouché, Lourens M. Pretorius, Conrad Johann Swanepoel
    Partition theorems for factorisations of ascending parameter words. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:331-350 [Journal]
  27. Julian D. Gilbey, Louis H. Kalikow
    Parking functions, valet functions and priority queues. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:351-373 [Journal]
  28. Joan Gimbert
    On the existence of (d, k)-digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:375-391 [Journal]
  29. Willem H. Haemers
    Minimum resolvable coverings with small parallel classes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:393-396 [Journal]
  30. Heiko Harborth, Silke Maasberg
    All two-color Rado numbers for a(x + y) = bz. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:397-407 [Journal]
  31. Bert Hartnell, Douglas F. Rall
    A bound on the size of a graph with given order and bondage number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:409-413 [Journal]
  32. Michael A. Henning
    Graphs with large restrained domination number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:415-429 [Journal]
  33. Cécile Huybrechts
    L · L*-geometries and Dn-buildings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:431-451 [Journal]
  34. Stanislav Jendrol, Tomás Madaras, Roman Sotak, Zsolt Tuza
    On light cycles in plane triangulations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:453-467 [Journal]
  35. Martin Klazar
    Extremal problems for colored trees and Davenport-Schinzel sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:469-482 [Journal]
  36. E. Kolev, R. Hill
    An improved lower bound on the covering number K2(9, 1). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:483-489 [Journal]
  37. Francisco Larrión, Victor Neumann-Lara
    Clique divergent graphs with unbounded sequence of diameters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:491-501 [Journal]
  38. Felix Lazebnik, Vasiliy A. Ustimenko, Andrew J. Woldar
    Polarities and 2k-cycle-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:503-513 [Journal]
  39. Vladimir I. Levenshtein
    Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:515-536 [Journal]
  40. Richard P. Lewis
    The number of spanning trees of a complete multipartite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:537-541 [Journal]
  41. Ebadollah S. Mahmoodian, Eric Mendelsohn
    On defining numbers of vertex colouring of regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:543-554 [Journal]
  42. Jaume Martí-Farré
    Sets defining minimal vertex covers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:555-559 [Journal]
  43. John P. McSorley
    Single-change circular covering designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:561-588 [Journal]
  44. Mikhail E. Muzychuk
    On the isomorphism problem for cyclic combinatorial objects. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:589-606 [Journal]
  45. Atsuhiro Nakamoto
    Transformations in closed 2-cell embeddings on surfaces preserving specified properties. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:607-615 [Journal]
  46. Victor Neumann-Lara
    The acyclic disconnection of a digraph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:617-632 [Journal]
  47. Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia
    A note on covering the edges of a graph with bonds. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:633-636 [Journal]
  48. S. Perkins, A. E. Escott
    Synchronizing codewords of q-ary Huffman codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:637-655 [Journal]
  49. Donald A. Preece, B. J. Vowden
    Some series of cyclic balanced hyper-graeco-Latin superimpositions of three Youden squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:671-682 [Journal]
  50. Dieter Rautenbach
    The influence of special vertices on strong domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:683-690 [Journal]
  51. David H. Rees, Donald A. Preece
    Perfect Graeco-Latin balanced incomplete block designs (pergolas). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:691-712 [Journal]
  52. Irasema Sarmiento
    A characterisation of jointless Dowling geometries. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:713-731 [Journal]
  53. Ron Shaw
    A property of A7, and a maximal 3-dimensional linear section of GL(4, 2). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:733-747 [Journal]
  54. Angelo Sonnino
    Linear collineation groups preserving an arc in a Möbius plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:749-757 [Journal]
  55. Konrad J. Swanepoel
    Cardinalities of k-distance sets in Minkowski spaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:759-767 [Journal]
  56. Meike Tewes, Lutz Volkmann
    Vertex deletion and cycles in multipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:769-779 [Journal]
  57. Huib Trommel, Henk Jan Veldman, A. Verschut
    Pancyclicity of claw-free hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:781-789 [Journal]
  58. Kazuhiko Ushio
    Sk-factorization of symmetric complete tripartite digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:791-797 [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