The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1983, volume: 43, number: 2-3

  1. Raul Cordovil
    The directions determined by n points in the plane: a matroidal generalization. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:131-137 [Journal]
  2. Karel Culik II, Juhani Karhumäki
    Systems of equations over a free monoid and Ehrenfeucht's conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:139-153 [Journal]
  3. Michel Dehon
    On the existence of 2-designs Slambda(2, 3, upsilon) without repeated blocks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:155-171 [Journal]
  4. Martin Farber
    Characterizations of strongly chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:173-189 [Journal]
  5. D. J. Hartfiel
    Stochastic eigenvectors for qualitative stochastic matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:191-197 [Journal]
  6. J. D. Horton
    The construction of Kotzig factorizations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:199-206 [Journal]
  7. R. H. Jeurissen
    Pseudo-magic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:207-214 [Journal]
  8. T. A. McKee
    Duality principles for binary matroids and graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:215-222 [Journal]
  9. Richard J. Nowakowski, Ivan Rival
    The smallest graph variety containing all paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:223-234 [Journal]
  10. Richard J. Nowakowski, Peter Winkler
    Vertex-to-vertex pursuit in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:235-239 [Journal]
  11. Sergiu Rudeanu
    Linear Boolean equations and generalized minterms. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:241-248 [Journal]
  12. Masako Sato, Thien Tran Cong
    The number of minimal lattice paths restricted by two parallel lines. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:249-261 [Journal]
  13. Dieter Schäfer, Karl Erich Wolff
    Pólya enumeration of expansions of resolvable incidence structures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:263-271 [Journal]
  14. Howard Straubing
    A combinatorial proof of the Cayley-Hamilton theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:273-279 [Journal]
  15. Henk Jan Veldman
    Existence of dominating cycles and paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:281-296 [Journal]
  16. David Witte, Gail Letzter, Joseph A. Gallian
    On hamiltonian circuits in cartesian products of Cayley digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:297-307 [Journal]
  17. Joseph Zaks
    Extending two theorems of A. Kotzig. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:309-315 [Journal]
  18. François Bry
    On the factorization of graphs with exactly one vertex of infinite degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:317-320 [Journal]
  19. Peter Stein
    Chvátal's conjecture and point-intersections. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:321-323 [Journal]
  20. Peter Frankl
    A probabilistic proof for the lym-inequality. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:43, n:2-3, pp:325- [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