The SCEAS System
Navigation Menu

Journals in DBLP

Journal of Graph Theory
2004, volume: 47, number: 2

  1. Michael Plantholt
    Overfull conjecture for graphs with high minimum degree. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:2, pp:73-80 [Journal]
  2. Tomasz Luczak, Jaroslav Nesetril
    Note on projective graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:2, pp:81-86 [Journal]
  3. F. Havet
    Pancyclic arcs and connectivity in tournaments. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:2, pp:87-110 [Journal]
  4. Tomasz Luczak, Florian Pfender
    Claw-free 3-connected P11-free graphs are hamiltonian. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:2, pp:111-121 [Journal]
  5. Artem V. Pyatkin
    Interval coloring of (3, 4)-biregular bipartite graphs having large cubic subgraphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:2, pp:122-128 [Journal]
  6. Daphne Der-Fen Liu, Xuding Zhu
    Fractional chromatic number and circular chromatic number for distance graphs with large clique size. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:2, pp:129-146 [Journal]
  7. Xingxing Yu
    Infinite paths in planar graphs I: Graphs with radial nets. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:2, pp:147-162 [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