Tao Jiang On a Conjecture about Trees in Graphs with Large Girth. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:221-232 [Journal]
Martin Kochol An Equivalent Version of the 3-Flow Conjecture. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:258-261 [Journal]
Carsten Thomassen Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:262-271 [Journal]
Matthias Kriesell Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:305-319 [Journal]
Stéphan Thomassé Covering a Strong Digraph by -1 Disjoint Paths: A Proof of Las Vergnas' Conjecture. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2001, v:83, n:2, pp:331-333 [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