The SCEAS System
Navigation Menu

Journals in DBLP

Journal of Graph Theory
2006, volume: 52, number: 2

  1. Béla Bollobás, Graham Brightwell
    How many graphs are unions of k-cliques? [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:2, pp:87-107 [Journal]
  2. Bart De Bruyn
    Bounding the size of near hexagons with lines of size 3. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:2, pp:108-122 [Journal]
  3. Nurit Gazit, Michael Krivelevich
    On the asymptotic value of the choice number of complete multi-partite graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:2, pp:123-134 [Journal]
  4. János Barát, Carsten Thomassen
    Claw-decompositions and tutte-orientations. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:2, pp:135-146 [Journal]
  5. Gábor N. Sárközy, Stanley M. Selkow
    On an anti-Ramsey problem of Burr, Erdös, Graham, and T. Sós. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:2, pp:147-156 [Journal]
  6. Vladimir Nikiforov, Richard H. Schelp
    Cycle lengths in graphs with large minimum degree. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:2, pp:157-170 [Journal]
  7. Martin Knor, Ludovít Niepel
    Iterated line graphs are maximally ordered. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:52, n:2, pp:171-180 [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