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: 111, number: 1-3

  1. C. Berge
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:1- [Journal]
  2. Yousef Alavi, Jiuqiang Liu, Jianfang Wang
    Highly irregular digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:3-10 [Journal]
  3. Brian Alspach, Cun-Quan Zhang
    Cycle covers of cubic multigraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:11-17 [Journal]
  4. Denise Amar
    Applying a condition for a hamiltonian bipartite graph to be bipancyclic. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:19-25 [Journal]
  5. Annie Astié-Vidal, Vincent Dugat
    Autonomous parts and decomposition of regular tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:27-36 [Journal]
  6. Gabor Bascó, Zsolt Tuza
    Domination properties and induced subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:37-40 [Journal]
  7. L. Balcza
    Sum of lengths of inversions in permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:41-48 [Journal]
  8. Jean-Pierre Barthélemy, Julien Constantin
    Median graphs, parallelism and posets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:49-63 [Journal]
  9. Joaquim Borges, Josep Rifà
    A note about multidesigns and extended designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:65-69 [Journal]
  10. Mieczyslaw Borowiecki, Ewa Drgas-Burchardt
    Classes of chromatically unique graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:71-75 [Journal]
  11. Claude Carlet
    A general case of normal duality between binary nonlinear codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:77-85 [Journal]
  12. Yair Caro, Zsolt Tuza
    Bounded degrees and prescribed distances in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:87-93 [Journal]
  13. I. M. Chakravarti
    Geometric construction of some families of two-class and three-class association schemes and codes from nondegenerate and degenerate Hermitian varieties. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:95-103 [Journal]
  14. C. Chameni Nembua, Bernard Monjardet
    Finite pseudocomplemented lattices and 'permutoedre'. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:105-112 [Journal]
  15. C. C. Chen, K. M. Koh, Y. H. Peng
    On the higher-order edge toughness of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:113-123 [Journal]
  16. Fan R. K. Chung, Ronald L. Graham
    On hypergraphs having evenly distributed subhypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:125-129 [Journal]
  17. Raul Cordovil, M. L. Moreira
    A homotopy theorem on oriented matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:131-136 [Journal]
  18. Ilda P. F. da Silva
    On fillings of 2N-gons with rhombi. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:137-144 [Journal]
  19. Charles Delorme, Svatopluk Poljak
    The performance of an eigenvalue bound on the max-cut problem in some classes of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:145-156 [Journal]
  20. József Dénes, Gary L. Mullen
    Enumeration formulas for latin and frequency squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:157-163 [Journal]
  21. Roger B. Eggleton, Aviezri S. Fraenkel, R. Jaime Simpson
    Beatty sequences and Langford sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:165-178 [Journal]
  22. Péter L. Erdös
    A new bijection on rooted forests. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:179-188 [Journal]
  23. Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa
    The grid revisted. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:189-196 [Journal]
  24. Odile Favaron, Maryvonne Mahéo, Jean-François Saclé
    Some eigenvalue properties in graphs (conjectures of Graffiti - II). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:197-220 [Journal]
  25. Evelyne Flandrin, Jean-Luc Fouquet, Hao Li
    On hamiltonian claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:221-229 [Journal]
  26. András Frank
    Submodular functions in graph theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:231-243 [Journal]
  27. Komei Fukuda, Keiichi Handa
    Antipodal graphs and oriented matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:245-256 [Journal]
  28. Christine Garcia, Patrick Solé
    Diameter lower bounds for Waring graphs and multiloop networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:257-261 [Journal]
  29. Mario Gionfriddo, Giovanni Lo Faro
    2-Colourings in S(t, t + 1, v). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:263-268 [Journal]
  30. Harald Gropp
    Configurations and graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:269-276 [Journal]
  31. A. Guénoche
    Enumération des partitions de diamètre minimum. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:277-287 [Journal]
  32. Michel Habib, Michel Morvan, Jean-Xavier Rampon
    On the calculation of transitive reduction - closure of orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:289-303 [Journal]
  33. Pierre Hansen, Alain Hertz, Julio Kuplinsky
    Bounded vertex colorings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:305-312 [Journal]
  34. Pavol Hell, Karen Seyffarth
    Largest planar graphs of diameter two and fixed maximum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:313-322 [Journal]
  35. Anthony J. W. Hilton
    Recent results on the total chromatic number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:323-331 [Journal]
  36. Philippe Jégou, Marie-Catherine Vilarem
    On some partial line graphs of a hypergraph and the associated matroid. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:333-344 [Journal]
  37. Bruno Leclerc
    Lattice valuations, medians and majorities. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:345-356 [Journal]
  38. Bernt Lindström
    On algebraic matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:357-359 [Journal]
  39. Nadimpalli V. R. Mahadev, Ph. Solot, Dominique de Werra
    The cyclic compact open-shop scheduling problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:361-366 [Journal]
  40. Frédéric Maire
    Une note sur les contractions dans les polygones orthogonaux. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:367-371 [Journal]
  41. Jean François Maurras
    Hypergraphes de Petersen! Hypergraphes de Moore? [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:373-379 [Journal]
  42. Jean Mayer
    Case 6 of hadwiger's conjecture. III. The problem of 7-vertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:381-387 [Journal]
  43. Colin J. H. McDiarmid, Abdón Sánchez-Arroyo
    An upper bound for total colouring of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:389-392 [Journal]
  44. Matthias Middendorf, Frank Pfeiffer
    Weakly transitive orientations, Hasse diagrams and string graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:393-400 [Journal]
  45. Haruko Okamura
    Paths containing two adjacent edges in (2k+1)-edge-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:401-407 [Journal]
  46. Manfred Padberg
    Lehman's forbidden minor characterization of ideal 0-1 matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:409-420 [Journal]
  47. Renaud Palisse
    A short proof of fisher's inequality. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:421-422 [Journal]
  48. Svatopluk Poljak
    On existence theorems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:423-434 [Journal]
  49. Alain Quilliot
    Une extension du problème du point fixe pour des graphes simples. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:435-445 [Journal]
  50. André Raspaud
    Postman tours and cycle covers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:447-454 [Journal]
  51. Ingo Schiermeyer
    Computation of the 0-dual closure for hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:455-464 [Journal]
  52. Marc Wagowski
    Coordinatization of B-matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:465-479 [Journal]
  53. Yohei Yamasaki
    Shannon-like games are difficult. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:481-483 [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