Journals in DBLP

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

1. Frédéric Meunier
   A topological lower bound for the circular chromatic number of Schrijver graphs. [Citation Graph (0, 0)][DBLP]
   Journal of Graph Theory, 2005, v:49, n:4, pp:257-261 [Journal]
   
2. Florian Pfender
   Hamiltonicity and forbidden subgraphs in 4-connected graphs. [Citation Graph (0, 0)][DBLP]
   Journal of Graph Theory, 2005, v:49, n:4, pp:262-272 [Journal]
   
3. Stefan Felsner, William T. Trotter
   Posets and planar graphs. [Citation Graph (0, 0)][DBLP]
   Journal of Graph Theory, 2005, v:49, n:4, pp:273-284 [Journal]
   
4. Michael A. Henning
   A linear Vizing-like relation relating the size and total domination number of a graph. [Citation Graph (0, 0)][DBLP]
   Journal of Graph Theory, 2005, v:49, n:4, pp:285-290 [Journal]
   
5. Andrew McLennan
   The Erdös-Sós Conjecture for trees of diameter four. [Citation Graph (0, 0)][DBLP]
   Journal of Graph Theory, 2005, v:49, n:4, pp:291-301 [Journal]
   
6. Sandi Klavzar, Iztok Peterin
   Characterizing subgraphs of Hamming graphs. [Citation Graph (0, 0)][DBLP]
   Journal of Graph Theory, 2005, v:49, n:4, pp:302-312 [Journal]
   
7. Dániel Marx
   NP-completeness of list coloring and precoloring extension on the edges of planar graphs. [Citation Graph (0, 0)][DBLP]
   Journal of Graph Theory, 2005, v:49, n:4, pp:313-324 [Journal]
   
8. Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari, Hamed Hatami, Ruzbeh Tusserkani, Xuding Zhu
   Circular chromatic index of graphs of maximum degree 3. [Citation Graph (0, 0)][DBLP]
   Journal of Graph Theory, 2005, v:49, n:4, pp:325-335 [Journal]