The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1996, volume: 162, number: 1-3

  1. Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo
    On k-strong and k-cyclic digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:1-11 [Journal]
  2. Gerhard Benadé, Izak Broere, Betsie Jonck, Marietjie Frick
    Uniquely (m, k)tau-colourable graphs and k-tau-saturated graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:13-22 [Journal]
  3. Frank E. Bennett, J. Yin
    Packings and coverings of the complete directed multigraph with 3- and 4-circuits. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:23-29 [Journal]
  4. Béla Bollobás, Imre Leader
    Sums in the grid. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:31-48 [Journal]
  5. Mihai Caragui
    On a class of finite upper half-planes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:49-66 [Journal]
  6. Zhibo Chen
    On polynomial functions from Zn1 × Zn2 × ... × Znr to Zm. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:67-76 [Journal]
  7. K. H. Chew
    The chromatic index of graphs of high maximum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:77-91 [Journal]
  8. Feodor F. Dragan, Andreas Brandstädt
    r-Dominating cliques in graphs with hypertree structure. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:93-108 [Journal]
  9. Qingyan Du
    Chromaticity of the complements of paths and cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:109-125 [Journal]
  10. Yahya Ould Hamidoune
    On weighted sums in abelian groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:127-132 [Journal]
  11. G. M. Hamilton, C. Ramsay, I. T. Roberts, D. G. Rogers
    Uniform perfect systems of sets of iterated differences of size 41. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:133-150 [Journal]
  12. Neil Hindman, Hanno Lefmann
    Canonical partition relations for (m, p, c)-systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:151-174 [Journal]
  13. F. T. Howard
    Explicit formulas for degenerate Bernoulli numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:175-185 [Journal]
  14. Ferran Hurtado, Oriol Serra, Jorge Urrutia
    Hiding points in arrangements of segments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:187-197 [Journal]
  15. Alexandr V. Kostochka
    The total chromatic number of any multigraph with maximum degree five is at most seven. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:199-214 [Journal]
  16. Wolfgang Kühnel, Gunter Lassmann
    Permuted difference cycles and triangulated sphere bundles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:215-227 [Journal]
  17. Shahriar Shahriari
    On the structure of maximum 2-part Sperner families. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:229-238 [Journal]
  18. Jeffrey M. Vanderkam
    Path-sequential labellings of cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:239-249 [Journal]
  19. Xiaoya Zha
    Closed 2-cell embeddings of 4 cross-cap embeddable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:251-266 [Journal]
  20. Ingo Althöfer, Matthias Löwe
    Edge search in hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:267-271 [Journal]
  21. Yong-Gao Chen
    On m-harmonic sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:273-280 [Journal]
  22. G. L. Chia
    On graphs uniquely colorable under the action of their automorphism groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:281-284 [Journal]
  23. G. L. Chia
    On the chromatic equivalence class of a family of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:285-289 [Journal]
  24. P. Hoffmann
    Counting maximal cycles in binary matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:291-292 [Journal]
  25. Bill Jackson, Nicholas C. Wormald
    On the linear k-arboricity of cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:293-297 [Journal]
  26. Alexandr V. Kostochka, Michael Stiebitz, B. Wirth
    The colour theorems of Brooks and Gallai extended. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:299-303 [Journal]
  27. Dieter Kratsch, Jean-Xavier Rampon
    Width two posets are reconstructible. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:305-310 [Journal]
  28. Anthony J. Macula
    A simple construction of d-disjunct matrices with certain constant weights. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:311-312 [Journal]
  29. Frédéric Maffray, Myriam Preissmann
    On the NP-completeness of the k-colorability problem for triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:313-317 [Journal]
  30. Tsuyoshi Nishimura, Akira Saito
    Two recursive theorems on n-extendibility. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:319-323 [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