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

Journals in DBLP

Discrete Mathematics
2001, volume: 235, number: 1-3

  1. Bernhard Korte, Jaroslav Nesetril
    Vojtech Jarni'k's work in combinatorial optimization. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:1-17 [Journal]
  2. Carme Àlvarez, Josep Díaz, Maria J. Serna
    The hardness of intervalizing four colored caterpillars. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:19-27 [Journal]
  3. Luitpold Babel, Ton Kloks, Jan Kratochvíl, Dieter Kratsch, Haiko Müller, Stephan Olariu
    Efficient algorithms for graphs with few P4's. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:29-51 [Journal]
  4. S. Bylka
    Local improving algorithms for large cuts in graphs with maximum degree three. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:53-67 [Journal]
  5. Kathie Cameron
    Thomason's algorithm for finding a second hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:69-77 [Journal]
  6. Massimiliano Caramia, Paolo Dell'Olmo
    A lower bound on the chromatic number of Mycielski graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:79-86 [Journal]
  7. Jirí Fiala
    Computational complexity of covering cyclic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:87-94 [Journal]
  8. Petr Hlinený
    Contact graphs of line segments are NP-complete. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:95-106 [Journal]
  9. Florian Roussel, Irena Rusu
    An O(n2) algorithm to color Meyniel graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:107-123 [Journal]
  10. Ping Wang, Gerhard W. Dueck, S. MacMillan
    Using simulated annealing to construct extremal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:125-135 [Journal]
  11. Robert Babilon
    3-colourability of Penrose kite-and-dart tilings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:137-143 [Journal]
  12. Christian Bey
    An intersection theorem for weighted sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:145-150 [Journal]
  13. Sylvain Gravier, Michel Mollard, Charles Payan
    On the nonexistence of three-dimensional tiling in the Lee metric II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:151-157 [Journal]
  14. Izolda Gorgol
    A note on a triangle-free -- complete graph induced Ramsey number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:159-163 [Journal]
  15. Charles Laywine
    A derivation of an affine plane of order 4 from a triangle-free 3-colored K16. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:165-171 [Journal]
  16. Uwe Leck
    Optimal shadows and ideals in submatrix orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:173-187 [Journal]
  17. Ales Drápal
    Hamming distances of groups and quasi-groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:189-197 [Journal]
  18. Shalom Eliahou, Michel Kervaire
    Restricted sums of sets of cardinality 1+p in a vector space over Fp. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:199-213 [Journal]
  19. Hiroshi Era, Kenjiro Ogawa, Morimasa Tsuchiya
    On transformations of posets which have the same bound graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:215-220 [Journal]
  20. Sergei Evdokimov, Ilia N. Ponomarenko
    Two-closure of odd permutation group in polynomial time. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:221-232 [Journal]
  21. Miroslav Fiedler
    A numerical approach to long cycles in graphs and digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:233-236 [Journal]
  22. Dragan Stevanovic
    Hosoya polynomial of composite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:237-244 [Journal]
  23. Josep Díaz, Jordi Petit, Maria J. Serna, Luca Trevisan
    Approximating layout problems on random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:245-253 [Journal]
  24. János Komlós, Gábor N. Sárközy, Endre Szemerédi
    Proof of the Alon-Yuster conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:255-269 [Journal]
  25. Brendan Nagle, Vojtech Rödl
    The asymptotic number of triple systems not containing a fixed one. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:271-290 [Journal]
  26. Ioan Tomescu
    On the number of graphs and h-hypergraphs with bounded diameter. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:291-299 [Journal]
  27. Adam Idzik, Zsolt Tuza
    Heredity properties of connectedness in edge-coloured complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:301-306 [Journal]
  28. János Körner, Katalin Marton
    Relative capacity and dimension of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:307-315 [Journal]
  29. Frantisek Matús
    Excluded minors for Boolean polymatroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:317-321 [Journal]
  30. Ladislav Nebesky
    The set of geodesics in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:323-326 [Journal]
  31. Jaroslav Nesetril, Ales Pultr
    A note on homomorphism-independent families. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:327-334 [Journal]
  32. Václav Nýdl
    Graph reconstruction from subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:335-341 [Journal]
  33. Robert Sámal, Jan Vondrák
    The limit checker number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:343-347 [Journal]
  34. Bohdan Zelinka
    Periodicity of graph operators. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:349-351 [Journal]
  35. Denise Amar, André Raspaud, Olivier Togni
    All-to-all wavelength-routing in all-optical compound networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:353-363 [Journal]
  36. Elena V. Konstantinova, Vladimir A. Skorobogatov
    Application of hypergraph theory in chemistry. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:365-383 [Journal]
  37. Tomoki Nakamigawa
    Nakade -- a graph theoretic concept in Go. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:385-397 [Journal]
  38. Petr Pancoska, Vi't Janota, Jaroslav Nesetril
    Novel matrix descriptor for determination of the connectivity of secondary structure segments in proteins. Analysis of general properties using graph theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:235, n:1-3, pp:399-423 [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