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]

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]

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]

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]

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]