2005-02-02 Packing closed trails into dense graphs. 107-118 2003 88 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1016/S0095-8956(02)00039-4 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb88.html#Balister03 2005-02-02 The linear delta-matroid parity problem. 377-398 2003 88 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1016/S0095-8956(03)00039-X http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb88.html#GeelenIM03 2005-02-02 g-Elements of matroid complexes. 369-375 2003 88 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1016/S0095-8956(03)00038-8 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb88.html#Swartz03 2005-02-02 Hamiltonian decompositions of Cayley graphs on abelian groups of even order. 305-321 2003 88 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1016/S0095-8956(03)00033-9 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb88.html#Liu03b 2005-02-02 On the graphic matroid parity problem. 247-260 2003 88 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1016/S0095-8956(02)00045-X http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb88.html#Szigeti03 2005-02-07 Packing cycles in graphs, II. 244-253 2003 87 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1016/S0095-8956(02)00007-2 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#DingXZ03 2005-02-07 Non-separable detachments of graphs. 17-37 2003 87 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1016/S0095-8956(02)00026-6 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#JacksonJ03 2005-02-07 Disjoint cocircuits in matroids with large rank. 270-279 2003 87 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1016/S0095-8956(02)00010-2 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#GeelenGW03 2005-02-07 A new lower bound on the number of edges in colour-critical graphs and hypergraphs. 374-402 2003 87 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1016/S0095-8956(02)00035-7 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#KostochkaS03 2005-02-07 The independence fractal of a graph. 209-230 2003 87 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1016/S0095-8956(02)00014-X http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#BrownHN03 2005-02-07 On immersions of uncountable graphs. 130-137 2003 87 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1016/S0095-8956(02)00030-8 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#Andreae03 2005-02-07 Blocking nonorientability of a surface. 2-16 2003 87 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1016/S0095-8956(02)00025-4 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#MoharS03 2005-02-07 Coloring edges of graphs embedded in a surface of characteristic zero. 254-263 2003 87 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1016/S0095-8956(02)00008-4 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#SandersZ03 2005-06-22 Hamiltonian double latin squares. 81-129 2003 87 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1016/S0095-8956(02)00029-1 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#HiltonMRN03 2005-02-07 Ramsey numbers involving large dense graphs and bipartite Turán numbers. 280-288 2003 87 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1016/S0095-8956(02)00011-4 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#LiZ03 2005-02-07 <i>n</i>+2 alpha-2 arcs. 289-299 2003 87 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1016/S0095-8956(02)00020-5 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#BessyT03 2005-02-07 The chromatic number of a graph of girth 5 on a fixed surface. 38-71 2003 87 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1016/S0095-8956(02)00027-8 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#Thomassen03a 2005-02-07 On a lemma of Scarf. 72-80 2003 87 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1016/S0095-8956(02)00028-X http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#AharoniF03 2005-02-15 Bounds for mean colour numbers of graphs. 348-365 2003 87 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1016/S0095-8956(02)00023-0 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#Dong03 2005-02-07 On 2-arc-transitivity of Cayley graphs. 162-196 2003 87 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1016/S0095-8956(02)00033-3 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#Marusic03 2005-02-07 The countable Erds-Menger conjecture with ends. 145-161 2003 87 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1016/S0095-8956(02)00032-1 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#Diestel03 2005-02-07 Graphs with large maximum degree containing no odd cycles of a given length. 366-373 2003 87 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1016/S0095-8956(02)00024-2 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#BalisterBRS03 2005-10-31 2-Factor hamiltonian graphs. 138-144 2003 87 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1016/S0095-8956(02)00031-X http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#FunkJLS03 2005-02-07 Partitioning into graphs with only small components. 231-243 2003 87 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1016/S0095-8956(02)00006-0 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#AlonDV03 2005-02-07 Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs. 300-330 2003 87 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1016/S0095-8956(02)00021-7 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#ConfortiC03 2005-02-07 Graph-theoretical versus topological ends of graphs. 197-206 2003 87 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1016/S0095-8956(02)00034-5 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#DiestelK03 2005-02-07 <i>P</i>₆. 331-347 2003 87 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1016/S0095-8956(02)00022-9 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#CornuejolsL03 2005-02-07 Cliques in dense GF(q)-representable matroids. 264-269 2003 87 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1016/S0095-8956(02)00009-6 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb87.html#GeelenW03 2006-07-03 <i>k</i><i>n</i>-Connected Graphs. 296-314 2002 86 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2002.2129 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#Mader02 2005-02-07 Topological Minors in Graphs of Large Girth. 364-380 2002 86 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2002.2133 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#KuhnO02 2005-02-07 Sewing Ribbons on Graphs in Space. 1-26 2002 86 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2002.2076 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#ArchdeaconBRS02 2005-02-07 Branch-Width and Rota's Conjecture. 315-330 2002 86 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2002.2130 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#GeelenW02 2005-02-07 Long Cycles in 3-Connected Graphs. 80-99 2002 86 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2002.2113 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#ChenY02 2005-02-07 <i>K</i>_{a, k}Minors in Graphs of Bounded Tree-Width. 133-147 2002 86 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2002.2119 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#BohmeMM02 2005-02-07 On a Conjecture of Woodall. 172-185 2002 86 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2002.2121 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#Li02a 2005-02-07 Closure and Forbidden Pairs for Hamiltonicity. 331-346 2002 86 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2002.2131 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#Ryjacek02 2005-07-29 Nilpotent Families of Endomorphisms of (p(V)+, cup). 100-108 2002 86 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2002.2116 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#Fon-Der-FlaassKNRS02 2005-02-07 The Size of Bipartite Graphs with a Given Girth. 215-220 2002 86 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2002.2123 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#Hoory02 2005-02-07 Packing Cycles in Graphs. 381-407 2002 86 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2002.2134 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#DingZ02 2005-02-07 Reconstruction of Finite Truncated Semi-Modular Lattices. 254-272 2002 86 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2002.2126 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#RamponS02 2005-02-07 The Quadrangulation Conjecture for Orientable Surfaces. 54-79 2002 86 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2002.2112 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#BrownJ02 2005-02-07 Packing Odd Circuits in Eulerian Graphs. 280-295 2002 86 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2002.2128 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#GeelenG02 2005-07-25 Asymptotically the List Colouring Constants Are 1. 27-37 2002 86 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2002.2110 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#ReedS02 2006-02-01 On the Isomorphisms of Cayley Graphs of Abelian Groups. 38-53 2002 86 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2002.2111 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#FengLX02 2005-02-07 On the Connectivity Function of a Binary Matroid. 114-132 2002 86 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2002.2118 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#Lemos02 2005-02-07 A Short Proof of Seymour's Characterization of the Matroids with the Max-Flow Min-Cut Property. 273-279 2002 86 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2002.2127 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#Guenin02 2005-02-07 Another Proof of the Map Color Theorem for Nonorientable Surfaces. 221-253 2002 86 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2002.2124 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#Korzhik02 2005-02-07 Circular Colouring and Orientation of Graphs. 109-113 2002 86 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2002.2117 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#Zhu02 2006-01-31 Ramsey Properties of Families of Graphs. 413-419 2002 86 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2002.2136 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#GrahamLRR02 2005-02-07 On the Size of Edge Chromatic Critical Graphs. 408-412 2002 86 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2002.2135 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#SandersZ02 2005-04-12 The Maximal Exceptional Graphs. 347-363 2002 86 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2002.2132 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#CvetkoviLRS02 2005-02-07 On Matroids of Branch-Width Three. 148-171 2002 86 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2002.2120 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#HallOSW02 2005-02-07 Exponential Families of Non-isomorphic Non-triangular Orientable Genus Embeddings of Complete Graphs. 186-211 2002 86 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2002.2122 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb86.html#KorzhikV02 2005-02-07 Fair Hamilton Decompositions of Complete Multipartite Graphs. 290-296 2002 85 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2104 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#LeachR02 2005-02-07 Proof of a Conjecture of Bolloba's and Kohayakawa on the Erds-Stone Theorem. 222-254 2002 85 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2097 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#Ishigami02 2005-02-07 Generating Internally Four-Connected Graphs. 21-58 2002 85 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2001.2089 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#JohnsonT02 2005-02-07 Optimal Ear Decompositions of Matching Covered Graphs and Bases for the Matching Lattice. 59-93 2002 85 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2001.2090 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#CarvalhoLM02 2005-02-07 Coloring the Faces of Convex Polyhedra so That Like Colors Are Far Apart. 348-360 2002 85 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2109 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#SandersZ02a 2005-02-07 Contractible Edges and Triangles in k-Connected Graphs. 207-221 2002 85 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2096 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#Kawarabayashi02 2005-02-07 Evaluations of the Circuit Partition Polynomial. 261-268 2002 85 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2102 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#Bollobas02 2005-02-08 On a Conjecture of Lovász Concerning Bricks: II. Bricks of Finite Characteristic. 137-180 2002 85 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2001.2092 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#CarvalhoLM02b 2005-02-08 On a Conjecture of Lovász Concerning Bricks: I. The Characteristic of a Matching Covered Graph. 94-136 2002 85 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2001.2091 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#CarvalhoLM02a 2005-02-07 Distance Graphs with Finite Chromatic Number. 181-187 2002 85 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2001.2093 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#RuzsaTV02 2005-02-07 Products of Circulant Graphs Are Metacirculant. 197-206 2002 85 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2095 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#Sanders02 2005-02-07 Long Cycles in Graphs on a Fixed Surface. 338-347 2002 85 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2108 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#BohmeMT02 2005-02-07 Anti-Ramsey Numbers of Subdivided Graphs. 361-366 2002 85 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2105 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#Jiang02 2005-02-07 Embedding Digraphs on Orientable Surfaces. 1-20 2002 85 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2001.2085 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#BonningtonCMM02 2005-02-07 Families of Regular Graphs in Regular Maps. 269-289 2002 85 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2103 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#Wilson02 2005-02-07 Coloring Face-Hypergraphs of Graphs on Surfaces. 307-337 2002 85 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2107 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#KundgenR02 2005-02-07 On the Density of Identifying Codes in the Square Lattice. 297-306 2002 85 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2106 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#HonkalaL02a 2005-02-07 Disjoint Cycles in Eulerian Digraphs and the Diameter of Interchange Graphs. 189-196 2002 85 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2094 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#BrualdiS02 2005-02-07 A Short Proof of Guenin's Characterization of Weakly Bipartite Graphs. 255-260 2002 85 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2101 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb85.html#Schrijver02 2005-02-07 Odd Wheels in Graphs. 213-224 2002 84 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2073 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#XuJL02 2005-02-07 A Fully Combinatorial Algorithm for Submodular Function Minimization. 203-212 2002 84 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2072 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#Iwata02 2005-02-07 <i>K</i>_{2, t}Minors in Plane Graphs. 291-300 2002 84 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2083 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#BohmeM02 2005-02-07 Coloring Locally Bipartite Graphs on Surfaces. 301-310 2002 84 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2086 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#MoharS02 2005-02-07 One or Two Disjoint Circuits Cover Independent Edges: Lovász-Woodall Conjecture. 1-44 2002 84 1 J. Comb. Theory, Ser. B http://dx.doi.org/10.1006/jctb.2001.2059 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#Kawarabayashi02a 2005-02-07 Branch-Width and Well-Quasi-Ordering in Matroids and Graphs. 270-290 2002 84 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2082 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#GeelenGW02 2005-02-07 Subgraph Coverings and Edge Switchings. 54-83 2002 84 1 J. Comb. Theory, Ser. B http://dx.doi.org/10.1006/jctb.2001.2063 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#Fan02 2005-02-07 Totally Free Expansions of Matroids. 130-179 2002 84 1 J. Comb. Theory, Ser. B http://dx.doi.org/10.1006/jctb.2001.2068 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#GeelenOVW02 2005-02-07 Colouring Eulerian Triangulations. 225-239 2002 84 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2074 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#HutchinsonRS02 2005-02-07 On Essential and Inessential Polygons in Embedded Graphs. 100-117 2002 84 1 J. Comb. Theory, Ser. B http://dx.doi.org/10.1006/jctb.2001.2065 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#RichterV02 2005-02-07 Three Moves on Signed Surface Triangulations. 118-125 2002 84 1 J. Comb. Theory, Ser. B http://dx.doi.org/10.1006/jctb.2001.2066 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#EliahouGP02 2005-02-07 Distribution of Cycle Lengths in Graphs. 187-202 2002 84 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2071 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#Fan02a 2005-02-07 The Number of Loopless 4-Regular Maps on the Projective Plane. 84-99 2002 84 1 J. Comb. Theory, Ser. B http://dx.doi.org/10.1006/jctb.2001.2064 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#RenL02 2005-02-07 How Many Steps Are Necessary to Separate a Bigraph? 126-129 2002 84 1 J. Comb. Theory, Ser. B http://dx.doi.org/10.1006/jctb.2001.2067 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#Portmann02 2006-02-13 Patch Colorings and Rigid Colorings of the Rational n-Space. 45-53 2002 84 1 J. Comb. Theory, Ser. B http://dx.doi.org/10.1006/jctb.2001.2062 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#KubickiLM02 2005-02-07 Disconnected 2-Factors in Planar Cubic Bridgeless Graphs. 249-259 2002 84 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2079 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#Diwan02 2005-02-07 The Numbers of Dependent k-Sets in a Graph Are Log Concave. 180-185 2002 84 1 J. Comb. Theory, Ser. B http://dx.doi.org/10.1006/jctb.2001.2077 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#Horrocks02 2005-02-07 Graphs with Magnetic Schrödinger Operators of Low Corank. 311-339 2002 84 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2087 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#Holst02 2005-02-07 Polynomials Associated with Nowhere-Zero Flows. 260-269 2002 84 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2081 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#Kochol02 2005-02-07 On the Parity of Colourings and Flows. 364-365 2002 84 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2084 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#GoodallW02 2005-02-07 A Continuous Analogue of the Girth Problem. 340-363 2002 84 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2088 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#AmitHL02 2005-02-07 Vertex Ramsey Properties of Families of Graphs. 240-248 2002 84 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2078 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb84.html#LuczakRU02 2005-02-07 Graph Imperfection II. 79-101 2001 83 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2001.2043 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#GerkeM01a 2005-02-07 Graph Imperfection. 58-78 2001 83 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2001.2042 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#GerkeM01 2005-02-07 Partitioning Vertices of a Tournament into Independent Cycles. 213-220 2001 83 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2048 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#ChenGL01 2005-02-07 Flexibility of Polyhedral Embeddings of Graphs in Surfaces. 38-57 2001 83 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2001.2036 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#MoharR01 2005-02-07 High-Girth Graphs Avoiding a Minor are Nearly Bipartite. 1-14 2001 83 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.2009 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#GalluccioGH01 2005-02-07 Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph. 262-271 2001 83 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2056 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#Thomassen01 2005-02-07 On a Conjecture about Trees in Graphs with Large Girth. 221-232 2001 83 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2049 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#Jiang01 2005-02-07 Matroid 4-Connectivity: A Deletion-Contraction Theorem. 15-37 2001 83 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2001.2032 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#GeelenW01 2005-02-07 Dynamic Monopolies of Constant Size. 191-200 2001 83 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2045 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#Berger01 2005-02-07 On the Spectral Radius of Graphs with Cut Vertices. 233-240 2001 83 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2052 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#BermanZ01 2005-02-07 A Characterization of Weakly Bipartite Graphs. 112-168 2001 83 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2001.2051 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#Guenin01 2005-02-07 An Equivalent Version of the 3-Flow Conjecture. 258-261 2001 83 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2054 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#Kochol01 2005-02-07 Covering a Strong Digraph by -1 Disjoint Paths: A Proof of Las Vergnas' Conjecture. 331-333 2001 83 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2055 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#Thomasse01 2005-02-07 A New Bound on the Cyclic Chromatic Number. 102-111 2001 83 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2001.2046 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#SandersZ01 2005-09-13 About Skew Partitions in Minimal Imperfect Graphs. 171-190 2001 83 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2044 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#RousselR01 2005-02-07 Choosability in Random Hypergraphs. 241-257 2001 83 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2053 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#KrivelevichV01 2005-02-07 Almost All 3-Connected Graphs Contain a Contractible Set of k Vertices. 305-319 2001 83 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2060 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#Kriesell01 2005-02-07 A Transformation Which Preserves the Clique Number. 320-330 2001 83 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2061 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#GerberH01 2005-02-07 On the Chromatic Roots of Generalized Theta Graphs. 272-297 2001 83 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2057 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#BrownHSW01 2005-02-07 Planar Graphs of Maximum Degree Seven are Class I. 201-212 2001 83 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2047 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#SandersZ01a 2005-02-07 Irreducibility of the Tutte Polynomial of a Connected Matroid. 298-304 2001 83 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2058 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb83.html#MerinoMN01 2005-02-15 Face Covers and the Genus Problem for Apex Graphs. 102-117 2001 82 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.2026 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#Mohar01 2005-02-15 Long Cycles through a Linear Forest. 67-80 2001 82 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.2022 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#HuTW01 2005-02-15 On Structure of Some Plane Graphs with Application to Choosability. 285-296 2001 82 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2038 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#LamSX01 2005-02-15 Line Graphs and Forbidden Induced Subgraphs. 38-55 2001 82 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.2019 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#LaiS01 2005-02-15 Anti-Ramsey Colorings in Several Rounds. 1-18 2001 82 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.2016 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#BlokhuisFGR01 2005-02-15 All 4-connected Line Graphs of Claw Free Graphs Are Hamiltonian Connected. 306-315 2001 82 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2040 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#Kriesell01b 2005-02-15 _m_nwith One Disjoint Family II. 161-165 2001 82 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.2015 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#JuarezS01 2005-02-15 4-Regular Maps on the Klein Bottle. 118-137 2001 82 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.2030 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#RenL01 2005-02-15 A Generalization of a Theorem of Dirac. 322-326 2001 82 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2041 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#DenleyW01 2005-02-15 On the Largest Component of the Random Graph at a Nearcritical Stage. 237-269 2001 82 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2000.2033 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#Pittel01 2005-02-15 Fragmentability of Graphs. 30-37 2001 82 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.2018 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#EdwardsF01 2005-02-15 Regular Graphs with No Homomorphisms onto Cycles. 155-160 2001 82 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.2014 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#WanlessW01 2005-02-15 A New Upper Bound on the Cheeger Number of a Graph. 167-174 2001 82 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2000.2023 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#DragomirB01 2005-02-15 A Matrix Method for Chromatic Polynomials. 19-29 2001 82 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.2017 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#Biggs01 2005-02-15 A Degree Sum Condition for the Existence of a Contractible Edge in a kappa-Connected Graph. 81-101 2001 82 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.2024 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#Kriesell01a 2005-02-15 A Characterisation of Pfaffian Near Bipartite Graphs. 175-222 2001 82 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2000.2025 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#FischerL01 2005-02-15 Directed Tree-Width. 138-154 2001 82 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.2031 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#JohnsonRST01 2005-02-15 Steinitz Representations of Polyhedra and the Colin de Verdie`re Number. 223-236 2001 82 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2000.2027 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#Lovasz01a 2005-02-15 A Short Proof of Mader's sigma-Paths Theorem. 319-321 2001 82 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2000.2029 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#Schrijver01 2005-02-15 Bicliques and Eigenvalues. 56-66 2001 82 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.2020 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#Haemers01 2005-11-30 _r-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges. 316-318 2001 82 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2000.2028 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#AkbariMS01 2005-02-15 Covering Non-uniform Hypergraphs. 270-284 2001 82 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2037 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#BorosCFY01 2005-02-15 Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs. 297-305 2001 82 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2001.2039 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb82.html#FavaronF01 2006-04-26 Chromatic Number and the 2-Rank of a Graph. 142-149 2001 81 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.2003 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#GodsilR01 2005-02-15 Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions of Random Regular Graphs. 20-44 2001 81 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.1991 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#KimW01 2005-02-15 Determination of all Regular Maps of Small Genus. 224-242 2001 81 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2000.2008 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#ConderD01 2005-02-15 A Sharp Upper Bound of the Spectral Radius of Graphs. 177-183 2001 81 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2000.1997 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#HongSF01 2005-02-15 On Non-Cayley Vertex-Transitive Graphs of Order a Product of Three Primes. 1-19 2001 81 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.1985 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#IranmaneshP01 2005-02-15 On the Maximum Number of Cyclic Triples in Oriented Graphs. 165-176 2001 81 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2000.1995 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#BeinekeH01 2005-02-15 Balanced 0-1 Matrices II. Recognition Algorithm. 275-306 2001 81 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2000.2011 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#ConfortiCKV01a 2005-02-15 Balanced 0-1 Matrices I. Decomposition. 243-274 2001 81 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2000.2010 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#ConfortiCKV01 2005-02-15 Ramanujan Edge-Indexed Graphs. 184-204 2001 81 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2000.1998 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#Mokhtari-Sharghi01 2005-02-15 Some Results Related to the Evasiveness Conjecture. 110-124 2001 81 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.2000 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#Lutz01 2005-02-15 On a Hamiltonian Cycle in Which Specified Vertices Are Uniformly Distributed. 100-109 2001 81 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.1999 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#KanekoY01 2005-02-15 A Note on the McKay-Miller-Sira'n Graphs. 205-208 2001 81 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2000.2006 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#Siagiova01 2005-02-15 On Half-Transitive Metacirculant Graphs of Prime-Power Order. 45-57 2001 81 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.1992 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#LiS01 2005-02-15 The Terwilliger Algebra of a 2-Homogeneous Bipartite Distance-Regular Graph. 125-141 2001 81 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.2002 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#Curtin01 2005-02-15 _n_n-I. 77-99 2001 81 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.1996 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#AlspachG01 2005-02-15 On Deeply Critical Oriented Graphs. 150-155 2001 81 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.1984 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#BorodinFKRS01 2005-02-15 Nowhere-Zero Flows in Random Graphs. 209-223 2001 81 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2000.2007 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#Sudakov01 2005-02-15 The Extremal Function for Complete Minors. 318-338 2001 81 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2000.2013 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#Thomason01 2005-02-15 On Finite s-Transitive Graphs of Odd Order. 307-317 2001 81 J. Comb. Theory, Ser. B 2 http://dx.doi.org/10.1006/jctb.2000.2012 http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#Li01a 2005-02-15 On the Number of Nonisomorphic Orientable Regular Embeddings of Complete Graphs. 58-76 2001 81 J. Comb. Theory, Ser. B 1 http://dx.doi.org/10.1006/jctb.2000.1