The SCEAS System
Navigation Menu

Journals in DBLP

Journal of Graph Theory
2005, volume: 48, number: 4

  1. Xingxing Yu
    Infinite paths in planar graphs II, structures and ladder nets. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:4, pp:247-266 [Journal]
  2. Tomás Kaiser, MingChu Li, Zdenek Ryjácek, Liming Xiong
    Hourglasses and Hamilton cycles in 4-connected claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:4, pp:267-276 [Journal]
  3. Elaine M. Eschen, Chính T. Hoàng, Mark D. T. Petrick, R. Sritharan
    Disjoint clique cutsets in graphs without long holes. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:4, pp:277-298 [Journal]
  4. Daniel Král, Jana Maxová, Robert Sámal, Pavel Podbrdský
    Hamilton cycles in strong products of graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:4, pp:299-321 [Journal]
  5. Vasyl Dmytrenko, Felix Lazebnik, Raymond Viglione
    Isomorphism criterion for monomial graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:4, pp:322-328 [Journal]
  6. Daphne Der-Fen Liu, Xuding Zhu
    Erratum to: "Fractional chromatic number and circular chromatic number for distance graphs with large clique size" Journal of Graph Theory 47(2) 2004, 129-146. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:4, pp:329-330 [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