The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Rafal Kalinowski, Antoni Marczyk, Mariusz Meszka, A. Pawel Wojda
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:1-0 [Journal]
  2. Mohamed El Kadi Abderrezzak, Evelyne Flandrin, Denise Amar
    Cyclability and pancyclability in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:3-11 [Journal]
  3. Krystyna T. Balinska, Slobodan K. Simic
    The nonregular, bipartite, integral graphs with maximum degree 4. Part I: basic properties. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:13-24 [Journal]
  4. Vincent Barré, Jean-Luc Fouquet
    On minimal cutsets in P5-free minimal imperfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:25-36 [Journal]
  5. Cristina Bazgan, Amel Harkat-Benhamdine, Hao Li, Mariusz Wozniak
    A note on the vertex-distinguishing proper coloring of graphs with large minimum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:37-42 [Journal]
  6. Halina Bielak, Izolda Gorgol
    The planar Ramsey number for C4 and K5 is 13. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:43-51 [Journal]
  7. Mieczyslaw Borowiecki, Peter Mihók
    On graphs with a local hereditary property. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:53-58 [Journal]
  8. Charles Delorme
    Presentations of groups generated by transpositions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:59-64 [Journal]
  9. Odile Favaron, Evelyne Flandrin, Hao Li, Zdenek Ryjácek
    Clique covering and degree conditions for hamiltonicity in claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:65-80 [Journal]
  10. Odile Favaron
    Inflated graphs with equal independence number and upper irredundance number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:81-94 [Journal]
  11. Jean-Luc Fouquet, Florian Roussel, P. Rubio, Henri Thuillier
    New classes of perfectly orderable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:95-109 [Journal]
  12. Dalibor Froncek
    Self-complementary factors of almost complete tripartite graphs of even order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:111-122 [Journal]
  13. Waclaw Frydrych
    Nonhamiltonian 2-connected claw-free graphs with large 4-degree sum. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:123-130 [Journal]
  14. Krzysztof Giaro, Marek Kubale, Michal Malafiejski
    Consecutive colorings of the edges of general graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:131-143 [Journal]
  15. Heiko Harborth, Christian Thürmann
    Smallest limited snakes in d-grids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:145-149 [Journal]
  16. Robert Janczewski, Marek Kubale, Krzysztof Manuszewski, Konrad Piwakowski
    The smallest hard-to-color graph for algorithm DSATUR. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:151-165 [Journal]
  17. Stanislav Jendrol, Zdzislaw Skupien
    Local structures in plane maps and distance colourings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:167-177 [Journal]
  18. Michal Karonski, Magdalena Szymkowiak
    On a solution of a randomized three tracks variant of the Gate Matrix Layout problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:179-189 [Journal]
  19. Arnfried Kemnitz, Heiko Harborth
    Plane integral drawings of planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:191-195 [Journal]
  20. Hamamache Kheddouci, Susan Marshall, Jean-François Saclé, Mariusz Wozniak
    On the packing of three graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:197-225 [Journal]
  21. Vadim E. Levit, Eugen Mandrescu
    On the structure of ?-stable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:227-243 [Journal]
  22. Tomasz Luczak, Andrzej Rucinski, Sebastian Urbanski
    On minimal Folkman graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:245-262 [Journal]
  23. Zofia Majcher, Jerzy Michael, Joanna Górska, Zdzislaw Skupien
    The minimum size of fully irregular oriented graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:263-272 [Journal]
  24. Peter Mihók
    Minimal reducible bounds for the class of k-degenerate graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:273-279 [Journal]
  25. Vojislav Petrovic
    Path numbers of balanced bipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:281-285 [Journal]
  26. Leonid Plachta
    Voltage graphs, weight systems and odd symmetry. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:287-313 [Journal]
  27. Erich Prisner
    Eulerian iterated line graphs and digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:315-323 [Journal]
  28. Zdenek Ryjácek, Akira Saito, Richard H. Schelp
    Claw-free graphs with complete closure. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:325-338 [Journal]
  29. Martin Sonntag, Hanns-Martin Teichert
    On the sum number and integral sum number of hypertrees and complete hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:339-349 [Journal]
  30. Irmina A. Ziolo
    Subforests of bipartite digraphs -- the minimum degree condition. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:351-365 [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