Complete classification of tournaments having a disjoint union of directed paths as a minimum feedback arc set.Published in:Journal of Graph Theory, 2004, v. 45, n. 1, p. 28By:Garth Isaak;Darren A. NarayanPublication type:Article
Defective choosability of graphs with no edge-plus-independent-set minor.Published in:Journal of Graph Theory, 2004, v. 45, n. 1, p. 51By:Douglas R. WoodallPublication type:Article
Semi-transitive graphs.Published in:Journal of Graph Theory, 2004, v. 45, n. 1, p. 1By:Steve WilsonPublication type:Article
K-linked graphs with girth condition.Published in:Journal of Graph Theory, 2004, v. 45, n. 1, p. 48By:Ken-ichi KawarabayashiPublication type:Article
How many disjoint 2-edge paths must a cubic graph have?Published in:Journal of Graph Theory, 2004, v. 45, n. 1, p. 57By:Alexander Kelmans;Dhruv MubayiPublication type:Article