The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Maria Chudnovsky, Ken-ichi Kawarabayashi, Paul D. Seymour
    Detecting even holes. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:2, pp:85-111 [Journal]
  2. Edy Tri Baskoro, Mirka Miller, Jozef Sirán, Martin Sutton
    Complete characterization of almost Moore digraphs of degree three. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:2, pp:112-126 [Journal]
  3. Jesper Makholm Byskov, Bolette Ammitzbøll Madsen, Bjarke Skjernaa
    On the number of maximal bipartite subgraphs of a graph. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:2, pp:127-132 [Journal]
  4. Atsushi Kaneko, Mikio Kano, Kazuhiro Suzuki
    Partitioning complete multipartite graphs by monochromatic trees. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:2, pp:133-141 [Journal]
  5. Hong-Jian Lai, Yehong Shao, Mingquan Zhan
    Hamiltonian N2-locally connected claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:2, pp:142-146 [Journal]
  6. Daniela Kühn, Deryk Osthus
    Four-cycles in graphs without a given even cycle. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:2, pp:147-156 [Journal]
  7. Wayne Goddard, Michael A. Henning
    Multiple vertex coverings by cliques. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:2, pp:157-167 [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