The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Journals in DBLP

Discrete Mathematics
1993, volume: 122, number: 1-3

  1. Kunwarjit S. Bagga, Lowell W. Beineke, Marc J. Lipman, Raymond E. Pippert
    On the honesty of graph complements. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:1-6 [Journal]
  2. Paola Bandieri
    Contracted k-tessellations of closed surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:7-13 [Journal]
  3. Béla Bollobás, Imre Leader
    Maximal sets of given diameter in the grid and the torus. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:15-35 [Journal]
  4. H. J. Broersma, J. van den Heuvel, Henk Jan Veldman
    A generalization of Ore's Theorem involving neighborhood unions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:37-49 [Journal]
  5. Richard A. Brualdi, Jennifer J. Quinn Massey
    Incidence and strong edge colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:51-58 [Journal]
  6. William Y. C. Chen
    The theory of compositionals. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:59-87 [Journal]
  7. Ernest J. Cockayne, Christina M. Mynhardt
    The sequence of upper and lower domination, independence and irredundance numbers of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:89-102 [Journal]
  8. Karen L. Collins
    Factoring distance matrix polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:103-112 [Journal]
  9. S. Das, M. Sen
    An interval digraph in relation to its associated bipartite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:113-136 [Journal]
  10. Clelia de Felice
    A partial result about the factorization conjecture for finite variable-length codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:137-152 [Journal]
  11. T. C. Enns
    Hamiltonian circuits and paths in subset graphs with circular adjacency. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:153-165 [Journal]
  12. Hortensia Galeana-Sánchez
    Normal fraternally orientable graphs satisfy the strong perfect graph conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:167-177 [Journal]
  13. Pierre Hansen, Maolin Zheng
    A linear algorithm for perfect matching in hexagonal systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:179-196 [Journal]
  14. Frank Harary, Serge Lawrencenko, Vladimir P. Korzhik
    Realizing the chromatic numbers of triangulations of surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:197-204 [Journal]
  15. Peter Horák, Zsolt Tuza
    Large s-representable set systems with low maximum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:205-217 [Journal]
  16. Alexander V. Ivashchenko
    Representation of smooth surfaces by graphs. Transformations of graphs which do not change the Euler characteristic of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:219-233 [Journal]
  17. Krzysztof Kolodziejczyk
    Borsuk covering and planar sets with unique completion. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:235-244 [Journal]
  18. Renu Laskar, S. Stueckle, B. Piazza
    On the edge-integrity of some graphs and their complements. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:245-253 [Journal]
  19. Charles Laywine
    A counter-example to a conjecture relating complete sets of frequency squares and affine geometries. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:255-262 [Journal]
  20. Giuseppe Pirillo
    On a combinatorial property of Fibonacci semigroup. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:263-267 [Journal]
  21. Richard L. Roth
    Perfect colorings of multipatterns in the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:269-286 [Journal]
  22. Edward G. Thurber
    Addition chains - an erratic sequence. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:287-305 [Journal]
  23. Arthur T. White
    Treble dodging minor methods: ringing the cosets, on six bells. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:307-323 [Journal]
  24. Min-Li Yu
    On path factorizations of complete multipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:325-333 [Journal]
  25. Jochen Harant
    An upper bound for the radius of a 3-connected graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:335-341 [Journal]
  26. Stanley M. Selkow
    The independence number of graphs in terms of degrees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:343-348 [Journal]
  27. Miklós Bóna
    A Euclidean Ramsey theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:349-352 [Journal]
  28. Denis Hanson, Gary MacGillivray, Dale Youngs
    The size of a minimum five-chromatic K4-free graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:353-355 [Journal]
  29. Xing-De Jia
    Some remarks on minimal bases and maximal nonbases of integers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:357-362 [Journal]
  30. Chunhui Lai
    On the size of graphs with all cycle having distinct length. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:363-364 [Journal]
  31. Nian-Zu Li, Earl Glen Whitehead Jr.
    The chromaticity of certain graphs with five triangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:365-372 [Journal]
  32. Marko Lovrecic Sarazin
    On the hamiltonian index of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:373-376 [Journal]
  33. Eduardo Montenegro, Reinaldo Salazar
    A result about the incident edges in the graphs Mk. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:377-380 [Journal]
  34. Sergiu Rudeanu
    Unique solutions of Boolean ring equations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:381-383 [Journal]
  35. Matthias F. M. Stallmann
    On counting planar embeddings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:385-392 [Journal]
  36. Ulrich Teschner
    A counterexample to a conjecture on the bondage number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:122, n:1-3, pp:393-395 [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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002