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><sub>6</sub>.
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><sub>a, k</sub>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><sub>2, t</sub>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
<sub>m</sub><sub>n</sub>with 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
<sub>r</sub>-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
<sub>n</sub><sub>n</sub>-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.1993
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#KorzhikV01
2005-02-15
The Separator Theorem for Rooted Directed Vertex Graphs.
156-162
2001
81
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.2000.2001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb81.html#Panda01
2005-02-15
<i>n</i><i>3k</i>.
69-79
2000
80
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.2000.1969
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#Chen00a
2005-02-15
On Tail Distribution of Interpost Distance.
49-56
2000
80
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.2000.1966
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#KimP00a
2005-02-15
On the Dissection of Rectangles into Right-Angled Isosceles Triangles.
277-319
2000
80
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1987
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#SkinnerST00
2005-02-15
Minimal Antichains in Well-founded Quasi-orders with an Application to Tournaments.
258-276
2000
80
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1986
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#CherlinL00
2005-02-15
Colored Homomorphisms of Colored Mixed Graphs.
147-155
2000
80
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.2000.1977
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#NesetrilR00
2005-02-15
Zeta Functions of Graph Coverings.
247-257
2000
80
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1983
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#MizunoS00
2005-02-15
A Near Packing of Two Graphs.
98-103
2000
80
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.2000.1971
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#Eaton00
2005-02-15
On Minimally (n, )-Connected Graphs.
156-171
2000
80
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.2000.1979
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#KanekoO00
2005-02-15
A Characterization of Graphs with No Cube Minor.
179-201
2000
80
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1968
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#Maharry00
2005-02-15
Sinks in Acyclic Orientations of Graphs.
130-146
2000
80
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.2000.1975
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#GebhardS00
2005-02-15
On a Hopf Algebra in Graph Theory.
104-121
2000
80
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.2000.1973
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#Lando00
2005-02-15
Oriented Hamiltonian Cycles in Tournaments.
1-31
2000
80
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.2000.1959
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#Havet00
2005-02-15
Which Crossing Number Is It Anyway?
225-246
2000
80
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1978
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#PachT00
2005-02-15
Duality Theorems for Finite Structures (Characterising Gaps and Good Characterisations).
80-97
2000
80
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.2000.1970
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#NesetrilT00
2005-02-15
A Combinatorial Algorithm Minimizing Submodular Functions in Strongly Polynomial Time.
346-355
2000
80
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1989
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#Schrijver00
2005-02-15
Triangles and Neighbourhoods of Independent Sets in Graphs.
122-129
2000
80
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.2000.1974
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#RobertshawW00
2005-02-15
Unordered Canonical Ramsey Numbers.
172-177
2000
80
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.2000.1980
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#Richer00
2005-02-15
On the Excluded Minors for Quaternary Matroids.
57-68
2000
80
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.2000.1967
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#GeelenOVW00
2005-02-15
Contractible Subgraphs in 3-Connected Graphs.
32-48
2000
80
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.2000.1960
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#Kriesell00
2005-02-15
Vertex Set Partitions Preserving Conservativeness.
202-217
2000
80
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1972
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#AgeevK00
2005-02-15
Face Size and the Maximum Genus of a Graph 1. Simple Graphs.
356-370
2000
80
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1990
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#HuangL00
2005-02-15
Contraction-Deletion Invariants for Graphs.
320-345
2000
80
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1988
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#BollobasPR00
2005-02-15
Chromatic Roots and Hamiltonian Paths.
218-224
2000
80
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1976
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb80.html#Thomassen00
2005-02-15
Retracing Argument for Distance-Regular Graphs.
211-220
2000
79
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1961
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb79.html#Hiraki00
2005-02-15
Surfaces, Tree-Width, Clique-Minors, and Partitions.
221-246
2000
79
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1962
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb79.html#DingOSV00
2005-02-15
On Extremal Multiflows.
183-210
2000
79
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1958
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb79.html#IlaniKL00
2005-02-15
<sub>k</sub><sub>4</sub>).
172-176
2000
79
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1954
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb79.html#LazebnikW00
2005-02-15
Least-Distortion Euclidean Embeddings of Graphs: Products of Cycles and Expanders.
157-171
2000
79
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1953
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb79.html#LinialM00
2005-02-15
Connected Hyperplanes in Binary Matroids.
87-97
2000
79
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1949
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb79.html#McNultyW00
2005-02-15
<i>k</i>-Regular Matroids.
1-65
2000
79
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1947
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb79.html#OxleySV00
2005-02-15
On the Achromatic Number of Hypercubes.
177-182
2000
79
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1955
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb79.html#Roichman00
2005-02-15
Local and Mean Ramsey Numbers for Trees.
100-103
2000
79
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.2000.1950
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb79.html#BollobasKS00
2005-02-15
The Speed of Hereditary Properties of Graphs.
131-156
2000
79
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1952
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb79.html#BaloghBW00
2005-02-15
On Generalized Ramsey Theory: The Bipartite Case.
66-86
2000
79
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1948
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb79.html#AxenovichFM00
2005-02-15
2-Symmetric Transformations for 3-Manifolds of Genus 2.
105-130
2000
79
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1951
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb79.html#GrasselliMN00
2005-02-15
On a Crossing Number Result of Richter and Thomassen.
98-99
2000
79
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1943
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb79.html#Salazar00
2005-02-15
The Excluded Minors for GF(4)-Representable Matroids.
247-299
2000
79
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.2000.1963
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb79.html#GeelenGK00
2005-02-15
Gibbs Measures and Dismantlable Graphs.
141-166
2000
78
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1935
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#BrightwellW00
2005-02-15
Packing and Decomposition of Graphs with Trees.
123-140
2000
78
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1934
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#Yuster00
2005-06-17
Clique Minors in Graphs and Their Complements.
81-85
2000
78
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1930
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#ReedT00
2005-02-15
<i>DCI(CI)</i>-Subsets for Cyclic Group of Odd Prime Power Order.
24-34
2000
78
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1924
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#HuangM00
2005-02-15
A Simple Competitive Graph Coloring Algorithm.
57-68
2000
78
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1927
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#Kierstead00
2005-02-15
Vertex Partitions by Connected Monochromatic k-Regular Graphs.
115-122
2000
78
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1933
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#SarkozyS00
2005-02-15
Proof of a Chromatic Polynomial Conjecture.
35-44
2000
78
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1925
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#Dong00
2005-02-15
Quasi-Hamiltonicity: A Series of Necessary Conditions for a Digraph to Be Hamiltonian.
232-242
2000
78
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1942
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#GutinY00
2005-02-15
The Spectral Radius of Graphs on Surfaces.
45-56
2000
78
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1926
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#EllinghamZ00
2005-02-15
Exponential Families of Non-Isomorphic Triangulations of Complete Graphs.
169-184
2000
78
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1939
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#BonningtonGGS00
2005-02-15
Matchings in Graphs on Non-orientable Surfaces.
198-231
2000
78
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1941
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#Tesler00
2005-02-15
The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane.
274-276
2000
78
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1938
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#CaenF00
2005-02-15
Equivalence of Fleischner's and Thomassen's Conjectures.
277-279
2000
78
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1944
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#Kochol00
2005-02-15
On Random Graph Homomorphisms into Z.
86-114
2000
78
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1931
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#BenjaminiHM00
2005-02-15
<i>k</i><i>k</i><i>k</i>epsilon{3, 4}.
69-80
2000
78
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1929
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#Kriesell00a
2005-02-16
Maximum Balanced Flow in a Network.
185-197
2000
78
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1940
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#IlaniL00
2005-02-15
Oriented Hamiltonian Paths in Tournaments: A Proof of Rosenfeld's Conjecture.
243-273
2000
78
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1945
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#HavetT00
2005-02-15
Circuit Decompositions of Eulerian Graphs.
1-23
2000
78
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1923
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb78.html#FanZ00
2005-02-21
Alternating Graphs.
96-120
1999
77
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1915
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb77.html#AdamsDFKP99
2005-02-21
On the Edge Connectivity, Hamiltonicity, and Toughness of Vertex-Transitive Graphs.
138-149
1999
77
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1917
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb77.html#HeuvelJ99
2006-06-27
On 3-Connected Plane Graphs without Triangular Faces.
150-161
1999
77
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1918
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb77.html#HarantJT99
2005-02-21
A Characterization of the Orientations of Ternary Matroids.
263-291
1999
77
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1914
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb77.html#LeeS99
2005-02-21
Coloring Graphs with Sparse Neighborhoods.
73-82
1999
77
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1910
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb77.html#AlonKS99
2005-02-21
Stabilizers of Classes of Representable Matroids.
39-72
1999
77
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1908
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb77.html#Whittle99
2005-02-21
Decomposition of Balanced Matrices.
292-406
1999
77
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1932
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb77.html#ConfortiCR99
2005-02-21
Extending Graph Colorings.
83-95
1999
77
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1913
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb77.html#AlbertsonM99
2005-02-21
Graph Homomorphisms and Phase Transitions.
221-262
1999
77
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1899
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb77.html#BrightwellW99
2005-02-21
Graph Minors: XVII. Taming a Vortex.
162-210
1999
77
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1919
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb77.html#RobertsonS99
2005-02-21
Énumération des cartes pointées sur une surface orientable de genre quelconque en fonction des nombres de sommets et de faces.
1-24
1999
77
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1898
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb77.html#ArquesG99
2005-02-21
Constructing the Graphs That Triangulate Both the Torus and the Klein Bottle.
211-218
1999
77
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1920
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb77.html#LawrencenkoN99
2005-02-21
Cycle Bases for Lattices of Binary Matroids with No Fano Dual Minor and Their One-Element Extensions.
25-38
1999
77
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1904
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb77.html#FleinerHLL99
2005-02-21
Weakly Pancyclic Graphs.
121-137
1999
77
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1999.1916
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb77.html#BollobasT99
2005-02-21
The 4-Choosability of Plane Graphs without 4-Cycles'.
117-126
1999
76
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1893
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#LamXL99
2005-02-21
A Convolution Formula for the Tutte Polynomial.
297-300
1999
76
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1888
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#KookRS99
2005-02-21
Signed Domination in Regular Graphs and Set-Systems.
223-239
1999
76
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1905
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#FurediM99
2005-02-21
<i>Q</i>-Polynomial Quotients of Antipodal Distance-Regular Graphs.
291-296
1999
76
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1911
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#Caughman99
2005-02-21
The Connectivities of Leaf Graphs of 2-Connected Graphs.
155-169
1999
76
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1895
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#KanekoY99
2005-02-21
An Upper Bound for the Independent Domination Number.
240-246
1999
76
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1907
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#SunW99
2005-05-23
Induced Cycles and Chromatic Number.
150-154
1999
76
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1894
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#Scott99a
2005-02-21
Random Cayley Maps for Groups Generated by Involutions.
247-261
1999
76
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1909
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#Schultz99
2005-02-21
Locally Pancyclic Graphs.
22-40
1999
76
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1885
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#Stacho99
2005-02-21
Totally Critical Even Order Graphs.
262-279
1999
76
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1902
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#HamiltonHH99
2005-02-21
Norm-Graphs: Variations and Applications.
280-290
1999
76
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1906
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#AlonRS99
2005-02-21
Classical Distance-Regular Graphs of Negative Type.
93-116
1999
76
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1892
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#Weng99
2005-02-21
Negative Partition Relations for Ordinals omega omega alpha.
205-222
1999
76
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1903
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#Darby99
2005-02-21
Excluding a Countable Clique.
41-67
1999
76
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1886
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#DiestelT99
2005-02-21
Subdivisions and Chromatic Roots.
201-204
1999
76
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1901
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#Brown99a
2005-02-21
<sub>m</sub><sub>n</sub>with One Disjoint Family.
129-135
1999
76
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1890
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#Salazar99
2005-02-21
Diagonal Flips in Triangulations on Closed Surfaces with Minimum Degree at Least 4.
68-92
1999
76
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1889
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#KomuroNN99
2005-02-21
Planar Graphs with Circular Chromatic Numbers between 3 and 4.
170-200
1999
76
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1999.1900
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#Zhu99
2005-02-21
On the Spectrum, the Growth, and the Diameter of a Graph.
1-21
1999
76
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1882
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#Hajaj99
2005-06-17
A Strengthening of Brooks' Theorem.
136-149
1999
76
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1891
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb76.html#Reed99
2005-02-21
Finding Minimum Generators of Path Systems'.
237-244
1999
75
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1877
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#Frank99
2005-02-21
The Game Coloring Number of Planar Graphs.
245-258
1999
75
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1878
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#Zhu99a
2005-02-21
Some Formulas for Spin Models on Distance-Regular Graphs.
206-236
1999
75
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1876
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#CurtinN99
2005-02-21
<sub>n</sub><sub>n</sub><sub>n</sub>)<=(4+o(1)) n.
174-187
1999
75
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1874
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#Luczak99
2005-02-21
A Short Proof of a Theorem Concerning Degree Sums and Connectivity on Hamiltonian Graphs.
157-159
1999
75
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1867
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#Wei99a
2005-02-21
On the Vertex-Distinguishing Proper Edge-Colorings of Graphs.
288-301
1999
75
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1884
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#BazganHLW99
2005-02-21
The Existence of Exactlym-Coloured Complete Subgraphs.
1-18
1999
75
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1855
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#StaceyW99
2005-02-21
Two-Coloring the Edges of a Cubic Graph Such That Each Monochromatic Component Is a Path of Length at Most 5.
100-109
1999
75
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1868
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#Thomassen99
2005-02-21
On the Intersections of Systems of Curves.
56-60
1999
75
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1858
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#Salazar99a
2005-02-21
Highly Connected Sets and the Excluded Grid Theorem.
61-73
1999
75
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1862
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#DiestelJGT99
2005-02-21
A Pattern of Asymptotic Vertex Valency Distributions in Planar Maps.
116-133
1999
75
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1870
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#Liskovets99
2005-02-21
9-Connected Claw-Free Graphs Are Hamilton-Connected.
167-173
1999
75
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1871
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#Brandt99
2005-02-21
Distance Graphs and T-Coloring.
259-269
1999
75
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1881
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#ChangLZ99
2005-02-21
Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings.
270-287
1999
75
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1883
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#ZhouN99
2005-02-21
On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph.
110-115
1999
75
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1869
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#KanekoMW99
2005-02-21
Tetravalent Graphs Admitting Half-Transitive Group Actions: Alternating Cycles.
188-205
1999
75
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1875
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#MarusicP99
2005-02-21
On the Circumferences of Regular 2-Connected Graphs.
88-99
1999
75
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1866
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#Wei99
2005-02-21
Turán's Theorem and Maximal Degrees.
160-164
1999
75
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1873
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#Bollobas99
2005-02-22
Constructing 4-Valent 1/2-Transitive Graphs with a Nonsolvable Automorphism Group.
46-55
1999
75
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1857
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#MalniM99
2006-01-31
On Isomorphisms of Connected Cayley Graphs, II.
28-34
1998
74
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1830
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#Li98
2005-02-21
A Description of Claw-Free Perfect Graphs.
134-156
1999
75
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1872
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb75.html#MaffrayR99
2005-05-09
The nonexistence of projective planes of order 12 with a collineation group of order 16.
21-48
2004
107
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.03.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta107.html#Suetake04
2005-05-09
<sub>p</sub><sub>p</sub>.
49-67
2004
107
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.03.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta107.html#GaoRT04
2005-05-09
<i>q</i>=0.
1-19
2004
107
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.03.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta107.html#BergeronHT04
2005-05-09
On a 5-design related to an extremal doubly even self-dual code of length 72.
143-146
2004
107
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.03.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta107.html#HaradaKM04
2005-05-09
Excluded permutation matrices and the Stanley-Wilf conjecture.
153-160
2004
107
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.04.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta107.html#MarcusT04
2005-05-09
Growth diagrams, domino insertion and sign-imbalance.
87-115
2004
107
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.03.010
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta107.html#Lam04
2005-05-09
Asymptotics of combinatorial structures with large smallest component.
117-125
2004
107
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.04.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta107.html#BenderMPR04
2005-05-09
A note on the minimum number of edge-directions of a convex polytope.
147-151
2004
107
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.03.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta107.html#OnnP04
2005-05-09
A variant of Kemnitz Conjecture.
69-86
2004
107
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.03.009
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta107.html#GaoT04
2005-05-09
Combinatorial designs with two singular values--I: uniform multiplicative designs.
127-142
2004
107
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.04.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta107.html#DamS04
2005-05-09
<i>k</i>+5 points.
169-183
2004
108
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.06.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#CaoJL04
2005-05-09
Near polygons with a nice chain of sub-near polygons.
297-311
2004
108
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.07.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#BruynV04
2005-05-09
Border correlation of binary words.
331-341
2004
108
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.07.009
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#HarjuN04
2005-05-09
Cyclic codes with few weights and Niho exponents.
247-259
2004
108
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.07.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#Charpin04
2005-05-09
Maximal primitive hindering systems for convex figures.
261-273
2004
108
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.07.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#BoltyanskiG04
2005-05-09
Nowhere-zero flow polynomials.
205-215
2004
108
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.06.011
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#Onn04
2005-05-09
Covering by intersecting families.
51-61
2004
108
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.05.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#Sanders04
2005-05-09
The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal.
63-75
2004
108
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.06.009
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#AudetHMP04
2005-05-09
On Mathon's construction of maximal arcs in Desarguesian planes II.
99-122
2004
108
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.06.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#FiedlerLX04
2005-05-09
On Dowling geometries of infinite groups.
155-158
2004
108
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.06.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#BrooksbankQRS04
2005-05-09
Proof of two conjectures of Zuber on fully packed loop configurations.
123-146
2004
108
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.06.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#CaselliK04
2005-05-09
Box complexes, neighborhood complexes, and the chromatic number.
159-168
2004
108
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.06.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#CsorbaLSW04
2005-05-09
Stein's method, Jack measure, and the Metropolis algorithm.
275-296
2004
108
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.07.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#Fulman04
2005-05-09
<i>q</i>-series and truncated objects.
217-245
2004
108
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.05.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#CorteelS04
2005-05-09
Elation and translation semipartial geometries.
313-330
2004
108
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.07.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#Winter04
2005-05-09
On the number of directions determined by a three-dimensional points set.
1-16
2004
108
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.04.010
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#PachPS04
2005-05-09
<i><sub>n</sub></i>.
185-197
2004
108
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.06.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#Ono04
2005-05-09
A systematic approach to some block design constructions.
89-97
2004
108
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.06.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#GeL04
2005-05-09
A new matching property for posets and existence of disjoint chains.
77-87
2004
108
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.06.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#LoganS04
2005-05-09
The cyclic sieving phenomenon.
17-50
2004
108
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.04.009
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#ReinerSW04
2005-07-25
On a hypercube coloring problem.
199-204
2004
108
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.06.010
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#OstergArd04
2005-05-09
Bases in some additive groups and the Erds-Tura'n conjecture.
147-153
2004
108
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.05.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta108.html#HaddadH04
2005-05-09
Partial words and the critical factorization theorem.
221-245
2005
109
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.09.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#Blanchet-SadriD05
2005-05-09
The embedding in AG(3, q) of (0, 2)-geometries with no planar nets.
1-23
2005
109
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.06.012
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#Feyter05
2005-05-09
On primitivity and reduction for flag-transitive symmetric designs.
135-148
2005
109
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.08.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#Regueiro05
2005-05-09
Partition analysis and symmetrizing operators.
339-343
2005
109
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.08.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#FuL05
2005-05-09
Cranks and dissections in Ramanujan's lost notebook.
91-120
2005
109
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.06.013
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#BerndtCCL05
2005-05-09
Random walks and multiply intersecting families.
121-134
2005
109
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.08.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#FranklT05
2005-05-09
Cohen-Macaulay properties of square-free monomial ideals.
299-329
2005
109
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.09.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#Faridi05
2005-05-23
A generalization of an inequality of Brouwer-Wilbrink.
181-188
2005
109
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.07.011
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#HirakiK05
2005-05-09
Erdõs-Ko-Rado with conditions on the minimum complementary degree.
45-62
2005
109
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.07.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#Goldwasser05
2005-05-09
Almost disjoint families of 3-term arithmetic progressions.
75-90
2005
109
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.07.010
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#ArdalBP05
2005-05-09
Essential covers of the cube by hyperplanes.
331-338
2005
109
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.07.012
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#LinialR05
2005-05-09
Tangential Tallini sets in finite Grassmannians of lines.
189-202
2005
109
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.08.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#BicharaZ05
2005-05-09
On the Charney-Davis and Neggers-Stanley conjectures.
247-280
2005
109
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.09.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#ReinerW05
2005-05-09
Signed Mahonians.
25-43
2005
109
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.07.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#AdinGR05
2005-05-09
The minimum period of the Ehrhart quasi-polynomial of a rational polytope.
345-352
2005
109
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.08.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#McAllisterW05
2005-05-09
<i>S</i><sub>3</sub>.
281-298
2005
109
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.09.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#BandlowM05
2005-05-09
Polynomials with real zeros and Po'lya frequency sequences.
63-74
2005
109
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.07.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#WangY05
2005-05-09
Saturated simplicial complexes.
149-179
2005
109
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.08.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#MnukhinS05
2005-05-09
Random combinatorial structures: the convergent case.
203-220
2005
109
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.09.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta109.html#BarbourG05
2005-05-09
A generalization of the Farkas and Kra partition theorem for modulus 7.
43-52
2005
110
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.08.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#Warnaar05
2005-05-09
Enumeration of certain affine invariant extended cyclic codes.
71-95
2005
110
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.10.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#Hou05
2005-05-09
Factorization of the Robinson-Schensted-Knuth correspondence.
147-168
2005
110
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.10.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#Little05
2005-05-09
<i><sup>c</sup>L</i>: 2.
53-69
2005
110
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.10.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#MooriR05
2005-05-09
<i><sup>n</sup></i>.
169-173
2005
110
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.10.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#Soifer05
2005-05-09
A family of bijections between G-parking functions and spanning trees.
31-41
2005
110
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.08.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#ChebikinP05
2005-05-09
Graphical condensation for enumerating perfect matchings.
113-125
2005
110
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.10.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#YanZ05
2005-05-09
A combinatorial approach to jumping particles.
1-29
2005
110
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.09.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#DuchiS05
2005-05-09
Covering the symmetric groups with proper subgroups.
97-111
2005
110
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.10.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#Maroti05
2005-05-09
Finite automata and pattern avoidance in words.
127-145
2005
110
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.10.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#BrandenM05
2005-05-09
On a conjecture of Brown concerning accessible sets.
175-178
2005
110
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.10.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#Jungic05
2005-05-09
A 11, 707, 448, 673, 375 vertex graph related to the baby monster - II.
215-261
2004
107
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.04.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta107.html#RowleyW04a
2005-05-09
On point orbits of the Co2-minimal parabolic geometry.
263-293
2004
107
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.04.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta107.html#RowleyW04b
2005-05-09
A 11, 707, 448, 673, 375 vertex graph related to the baby monster - I.
181-213
2004
107
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.04.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta107.html#RowleyW04
2005-05-09
A polynomiality property for Littlewood-Richardson coefficients.
161-179
2004
107
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.04.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta107.html#Rassart04
2005-05-09
On partition functions of Andrews and Stanley.
313-321
2004
107
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.04.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta107.html#Yee04a
2005-05-09
Multicoloured extremal problems.
295-312
2004
107
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.05.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta107.html#BollobasKS04
2005-05-09
Double covers of cubic graphs with oddness 4.
251-277
2005
93
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2004.11.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb93.html#HaggkvistM05
2005-05-09
Contractible bonds in graphs.
207-249
2005
93
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2004.10.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb93.html#McGuinness05
2005-05-09
Average independence polynomials.
313-318
2005
93
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2004.10.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb93.html#BrownN05
2005-05-09
Random cubic graphs are not homomorphic to the cycle of size 7.
319-325
2005
93
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2004.11.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb93.html#Hatami05
2005-05-09
Counting connected graphs inside-out.
127-172
2005
93
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2004.09.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb93.html#PittelW05
2005-05-09
1-homogeneous, pseudo-1-homogeneous, and 1-thin distance-regular graphs.
279-302
2005
93
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2004.10.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb93.html#CurtinN05
2005-05-09
Path decompositions and Gallai's conjecture.
117-125
2005
93
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2004.09.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb93.html#Fan05
2005-06-17
<i>Delta-k</i>)-critical graphs.
173-185
2005
93
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2004.09.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb93.html#FarzadMR05
2005-05-09
Random planar graphs.
187-205
2005
93
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2004.09.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb93.html#McDiarmidSW05
2006-06-07
Planar graphs without cycles of length from 4 to 7 are 3-colorable.
303-311
2005
93
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2004.11.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb93.html#BorodinGRS05
2005-05-09
Independence free graphs and vertex connectivity augmentation.
31-77
2005
94
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2004.01.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb94.html#JacksonJ05a
2005-05-09
Even cycles in hypergraphs.
173-182
2005
94
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2004.12.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb94.html#KostochkaV05
2005-05-09
On packing Hamilton cycles in ?-regular graphs.
159-172
2005
94
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2004.12.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb94.html#FriezeK05
2005-05-09
Covering planar graphs with forests.
147-158
2005
94
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2004.12.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb94.html#BaloghKPY05
2005-05-09
Finite symmetric graphs with two-arc transitive quotients.
79-99
2005
94
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2004.11.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb94.html#IranmaneshPZ05
2005-05-09
The diameter of directed graphs.
183-186
2005
94
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2004.11.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb94.html#Dankelmann05
2005-05-09
Polynomials with the half-plane property and the support theorems.
117-145
2005
94
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2004.12.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb94.html#Choe05
2005-05-09
Connected rigidity matroids and unique realizations of graphs.
1-29
2005
94
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2004.11.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb94.html#JacksonJ05
2005-05-09
Topological properties of activity orders for matroid bases.
101-116
2005
94
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2004.11.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb94.html#BlokS05
2006-01-31
On 2-Connected Spanning Subgraphs with Low Maximum Degree.
64-86
1998
74
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1836
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#SandersZ98
2006-01-31
Reconstruction of Posets with the Same Comparability Graph.
368-377
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1859
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#IlleR98
2006-01-31
<sup>,</sup>.
302-310
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1851
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#Zhao98
2006-01-31
A Note on the Zeta Function of a Graph.
408-410
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1861
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#Northshield98
2006-01-31
Bicycle Dimension and Special Points of the Tutte Polynomial.
378-396
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1860
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#Vertigan98
2006-01-31
From Hall's Matching Theorem to Optimal Routing on Hypercubes.
291-301
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1850
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#GaoNQ98
2006-01-31
Not Every Uniform Tree Covers Ramanujan Graphs.
202-212
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1843
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#LubotzkyN98
2006-01-31
Short Solution of Kotzig's Problem for Bipartite Graphs.
160-168
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1838
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#Asratian98
2006-01-31
<sup>,</sup>.
153-159
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1837
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#Yuan98
2006-01-31
Even Pairs in Claw-Free Perfect Graphs.
169-191
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1841
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#SalesM98
2006-01-31
<i>k</i>-Critical Connected Line Graphs.
1-7
1998
74
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1823
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#Kriesell98
2006-01-31
New Results for the Martin Polynomial.
326-352
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1853
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#Ellis-Monaghan98
2006-01-31
Multiplicities of Eigenvalues and Tree-Width of Graphs.
121-146
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1834
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#Verdiere98
2006-01-31
An Algorithm for Packing Connectors.
397-404
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1863
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#Keijsper98
2006-01-31
Proofs of Two Minimum Circuit Cover Conjectures.
353-367
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1854
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#Fan98
2006-01-31
<sup>,</sup>.
87-103
1998
74
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1846
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#Hlineny98
2006-01-31
Directed Triangles in Digraphs.
405-407
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1839
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#Shen98
2006-01-31
Large Circuits in Binary Matroids of Large Cogirth, II.
53-63
1998
74
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1840
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#HochstattlerJ98a
2006-01-31
Vertices of Small Degree in Uniquely Hamiltonian Graphs.
265-275
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1845
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#BondyJ98
2006-01-31
Face 2-Colourable Triangular Embeddings of Complete Graphs.
8-19
1998
74
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1826
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#GrannellGS98
2006-01-31
<sup>,</sup>.
110-118
1998
74
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1828
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#McKayMS98
2006-01-31
Contractible Cycles in Graphs with Girth at Least 5.
213-264
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1844
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#Egawa98
2006-01-31
On 2-Arc-Transitive Covers of Complete Graphs.
276-290
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1847
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#DuMW98
2006-01-31
The Two Ear Theorem on Matching-Covered Graphs.
104-109
1998
74
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1824
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#Szigeti98
2006-01-31
Maximal and Minimal Vertex-Critical Graphs of Diameter Two.
311-325
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1852
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#HuangY98
2006-01-31
Cycles through Large Degree Vertices in Digraphs: A Generalization of Meyniel's Theorem.
20-27
1998
74
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1829
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#BermanL98
2006-01-31
Contractible Non-edges in 3-Connected Graphs.
192-201
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1842
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#Kriesell98a
2006-01-31
Large Circuits in Binary Matroids of Large Cogirth, I.
35-52
1998
74
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1998.1833
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#HochstattlerJ98
2006-01-31
Fractional Colouring and Hadwiger's Conjecture.
147-152
1998
74
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1835
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb74.html#ReedS98
2006-01-31
On the Density of Subgraphs in a Graph with Bounded Independence Number.
146-158
1998
73
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1818
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb73.html#Valtr98
2006-01-31
A Nebeský-Type Characterization for Relative Maximum Genus.
77-98
1998
73
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1810
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb73.html#ArchdeaconBS98
2006-01-31
You Can't Paint Yourself into a Corner.
189-194
1998
73
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1827
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb73.html#Albertson98
2006-01-31
Pattern Periodic Coloring of Distance Graphs.
195-206
1998
73
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1831
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb73.html#Zhu98
2006-01-31
Fractional Kernels in Digraphs.
1-6
1998
73
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1731
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb73.html#AharoniH98
2006-01-31
An Efficient Algorithm for Minimum-Weight Bibranching.
130-145
1998
73
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1817
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb73.html#KeijsperP98
2006-01-31
Upper Bounds on the Size of Obstructions and Intertwines.
7-40
1998
73
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1788
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb73.html#Lagergren98
2006-01-31
On Packing Connectors.
184-188
1998
73
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1825
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb73.html#KeijsperS98
2006-01-31
Half-Transitive Group Actions on Finite Graphs of Valency 4.
41-76
1998
73
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1807
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb73.html#Marusic98
2006-01-31
All Unit-Distance Graphs of Order 6197 Are 6-Colorable.
159-163
1998
73
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1819
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb73.html#Pritikin98
2006-01-31
Nonregular Graphs with Three Eigenvalues.
101-118
1998
73
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1815
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb73.html#Dam98
2006-01-31
Hamiltonian Decomposition of Lexicographic Products of Digraphs.
119-129
1998
73
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1816
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb73.html#Ng98
2006-01-31
Isomorphisms of Finite Cayley Digraphs of Bounded Valency.
164-183
1998
73
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1998.1820
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb73.html#LiPX98
2006-01-31
On the Roots of Chromatic Polynomials.
251-256
1998
72
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1813
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#Brown98
2006-01-31
List Homomorphisms to Reflexive Graphs.
236-250
1998
72
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1812
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#FederH98
2006-01-31
<i>k</i>-Connected Rayless Graphs.
257-260
1998
72
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1795
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#Halin98
2006-01-31
<i>g</i><i>f</i>)-Factors.
152-156
1998
72
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1797
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#Niessen98
2006-01-31
On the Connectivity of Graphs Embedded in Surfaces.
208-228
1998
72
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1809
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#PlummerZ98
2006-01-31
Any Knot Is Inevitable in a Regular Projection of a Planar Graph.
161-180
1998
72
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1805
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#Tsukamoto98
2006-01-31
Triangle-Free Circuit Decompositions and Petersen Minor.
197-207
1998
72
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1808
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#HeinrichLZ98
2006-01-31
A Characterization of Unique Tournaments.
157-159
1998
72
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1799
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#Tetali98
2006-01-31
Counting 1-Factors in Regular Bipartite Graphs.
122-135
1998
72
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1798
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#Schrijver98
2006-01-31
Subdivisions in Planar Graphs.
10-52
1998
72
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1774
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#Yu98
2006-01-31
The Solution of a Problem of Godsil on Cubic Cayley Graphs.
140-142
1998
72
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1801
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#Li98a
2006-01-31
A Splitter for Graphs with No Petersen Family Minor.
136-139
1998
72
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1800
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#Maharry98
2006-01-31
Independent Dominating Sets and a Second Hamiltonian Cycle in Regular Graphs.
104-109
1998
72
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1794
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#Thomassen98
2006-01-31
2-Partition-Transitive Tournaments.
181-196
1998
72
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1806
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#GuiduliGTW98
2006-01-31
Flows, View Obstructions, and the Lonely Runner.
1-9
1998
72
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1770
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#BieniaGGST98
2006-01-31
A Vertex-Splitting Lemma, de Werra's Theorem, and Improper List Colourings.
91-103
1998
72
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1793
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#HiltonSS98
2006-01-31
A Petersen on a Pentagon.
63-79
1998
72
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1791
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#SeymourT98
2006-01-31
Chromatic Coefficients of Linear Uniform Hypergraphs.
229-235
1998
72
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1811
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#Tomescu98
2006-01-31
Ramsey-Type Theorems for Spatial Graphs and Good Drawings.
53-62
1998
72
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1783
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#Negami98
2006-01-31
<i>p</i><sup>4</sup>.
110-121
1998
72
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1796
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#Chen98
2006-01-31
An Infinite Series of Surfaces with Known 1-Chromatic Number.
80-90
1998
72
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1792
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#Korzhik98
2006-01-31
A Note on List Arboricity.
150-151
1998
72
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1784
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#Seymour98
2006-01-31
Intersections of Longest Cycles in k-Connected Graphs.
143-149
1998
72
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1802
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb72.html#ChenFG98
2006-01-31
<i>K</i><sub>4</sub>-Free 4-Regular Connected Graphs.
85-110
1997
71
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1772
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#LockeL97
2006-01-31
Chords of Longest Cycles in Cubic Graphs.
211-214
1997
71
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1776
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#Thomassen97
2006-01-31
<sup>,</sup>.
17-53
1997
71
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1745
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#Dworkin97
2006-01-31
On the Pagenumber of Complete Bipartite Graphs.
111-120
1997
71
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1773
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#EnomotoNO97
2006-01-31
Removable Circuits in Multigraphs.
130-143
1997
71
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1775
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#GoddynHM97
2006-01-31
Automorphism Groups of Covering Graphs.
67-72
1997
71
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1763
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#SeifterT97
2006-01-31
Retracts of Infinite Hamming Graphs.
54-66
1997
71
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1746
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#Chastand97
2006-01-31
A 2-Isomorphism Theorem for Hypergraphs.
215-230
1997
71
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1789
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#VertiganW97
2006-01-31
Unavoidable Minors of Large 3-Connected Matroids.
244-293
1997
71
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1785
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#DingOOV97
2006-01-31
From Local Adjacency Polynomials to Locally Pseudo-Distance-Regular Graphs.
162-183
1997
71
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1778
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#FiolC97
2006-01-31
A Note on the Vertex-Connectivity Augmentation Problem.
294-301
1997
71
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1786
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#Jordan97
2006-01-31
Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap.
144-161
1997
71
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1768
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#AlonCY97
2006-01-31
Intersection Representation of Complete Unbalanced Bipartite Graphs.
123-129
1997
71
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1779
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#Eaton97
2006-01-31
Parallelogram-Free Distance-Regular Graphs.
231-243
1997
71
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1787
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#LiangW97
2006-01-31
The Number of Dependent Arcs in an Acyclic Orientation.
73-78
1997
71
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1769
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#FisherFLW97
2006-01-31
On the Number of Cycles in 3-Connected Cubic Graphs.
79-84
1997
71
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1771
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#AldredT97
2006-01-31
Covering Regular Graphs.
1-16
1997
71
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.1743
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#KratochvilPT97
2006-01-31
List Edge and List Total Colourings of Multigraphs.
184-204
1997
71
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1780
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#BorodinKW97
2006-01-31
Automorphism Groups of Graphs with Quadratic Growth.
205-210
1997
71
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1777
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb71.html#SeifterT97a
2006-01-31
Irreducible Triangulations of the Klein Bottle.
265-291
1997
70
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.9999
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#LawrencenkoN97
2006-01-31
Splitting Formulas for Tutte Polynomials.
346-366
1997
70
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1767
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#Andrzejak97
2006-01-31
The Largest Parity Demigenus of a Simple Graph.
325-345
1997
70
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1766
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#Zaslavsky97
2006-01-31
Some Theorems Concerning the Star Chromatic Number of a Graph.
245-258
1997
70
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.1738
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#Zhou97
2006-01-31
On a Closure Concept in Claw-Free Graphs.
217-224
1997
70
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.1732
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#Ryjacek97
2006-01-31
Tutte's Edge-Colouring Conjecture.
166-183
1997
70
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1752
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#RobertsonST97
2006-01-31
The Four-Colour Theorem.
2-44
1997
70
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1750
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#RobertsonSST97
2006-01-31
Edge-Ends in Countable Graphs.
225-244
1997
70
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.1734
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#HahnLS97
2006-01-31
A Note on Graph Colorings and Graph Polynomials.
197-201
1997
70
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1753
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#AlonT97
2006-01-31
A Longest Cycle Version of Tutte's Wheels Theorem.
202-215
1997
70
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1720
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#ReidW97
2006-01-31
A Generalization of Tutte's Characterization of Totally Unimodular Matrices.
101-117
1997
70
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1751
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#Geelen97
2006-01-31
Lê Numbers of Arrangements and Matroid Identities.
118-133
1997
70
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1755
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#MasseySSVWZ97
2006-01-31
The Membership Problem in Jump Systems.
45-66
1997
70
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1744
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#Lovasz97
2006-01-31
Special Issue Dedicated to W. T. Tutte.
1
1997
70
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1748
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#X97
2006-01-31
<i>C</i><sub>4</sub>.
367-372
1997
70
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1758
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#SacleW97
2006-01-31
A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces.
306-311
1997
70
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1761
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#Thomassen97b
2006-01-31
Two Remarks on the Coloring Number.
301-305
1997
70
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1760
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#Komjath97
2006-01-31
Diagonal Transformations of Graphs and Dehn Twists of Surfaces.
292-300
1997
70
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1759
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#NakamotoO97
2006-01-31
Color-Critical Graphs on a Fixed Surface.
67-100
1997
70
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.1722
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#Thomassen97a
2006-01-31
Making Curves Minimally Crossing by Reidemeister Moves.
134-156
1997
70
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1754
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#GraafS97
2006-01-31
Decomposition of Graphs on Surfaces.
157-165
1997
70
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1747
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#GraafS97a
2006-01-31
On Extensions of a Conjecture of Gallai.
317-324
1997
70
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1764
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#KezdyS97
2006-01-31
Two Chromatic Polynomial Conjectures.
184-196
1997
70
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1997.1749
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#Seymour97
2006-01-31
Note on Kocay's 3-Hypergraphs and Stockmeyer's Tournaments.
312-316
1997
70
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1762
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#Conilh97
2006-01-31
Finite Fields and Ramanujan Graphs.
259-264
1997
70
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.1740
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb70.html#Reyna97
2006-01-31
<sup>,</sup>.
210-218
1997
69
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1737
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#Haxell97
2006-01-31
Matroid Valuation on Independent Sets.
59-78
1997
69
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.1723
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#Murota97
2006-01-31
Extensions of Flow Theorems.
110-124
1997
69
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1727
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#Fan97
2006-01-31
The Genus Problem for Cubic Graphs.
52-58
1997
69
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.1721
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#Thomassen97c
2006-01-31
Simultaneously Colouring the Edges and Faces of Plane Graphs.
219-221
1997
69
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1725
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#Waller97
2006-01-31
The Structure of Well-Covered Graphs and the Complexity of Their Recognition Problems.
230-233
1997
69
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.1742
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#TankusT97
2006-01-31
Convex Programming and Circumference of 3-Connected Graphs of Low Genus.
39-51
1997
69
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.1719
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#GaoY97
2006-01-31
The Rank Facets of the Stable Set Polytope for Claw-Free Graphs.
1-38
1997
69
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.1715
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#GalluccioS97
2006-01-31
Five-Connected Toroidal Graphs Are Hamiltonian.
79-96
1997
69
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.1713
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#ThomasY97
2006-01-31
Subgraph Counting Identities and Ramsey Numbers.
193-209
1997
69
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.1741
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#McKayR97
2006-01-31
<i>sK</i><sub>1, 2</sub>Is Polynomial.
164-182
1997
69
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.1735
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#Lonc97
2006-01-31
<sup>,</sup>.
103-109
1997
69
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1724
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#MolloyR97
2006-01-31
A Note on Alternating Cycles in Edge-Coloured Graphs.
222-225
1997
69
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1728
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#Yeo97
2006-01-31
A Note on the Generalized Petersen Graphs That Are Also Cayley Graphs.
226-229
1997
69
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1729
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#Sarazin97
2006-01-31
Bridged Graphs Are Cop-Win Graphs: An Algorithmic Proof.
97-100
1997
69
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.1726
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#Chepoi97
2006-01-31
Diagonal Transformations in Quadrangulations and Dehn Twists Preserving Cycle Parities.
125-141
1997
69
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1997.1730
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#NakamotoO97a
2006-01-31
Geodetic Rays and Fibers in One-Ended Planar Graphs.
142-163
1997
69
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.1733
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#NiemeyerW97
2006-01-31
On the Convexified Sauer-Shelah Theorem.
183-192
1997
69
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.1736
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb69.html#SzarekT97
2006-01-31
Disjoint Directed Cycles.
167-178
1996
68
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0062
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#Alon96
2006-01-31
Diagonal Flips of Triangulations on Closed Surfaces Preserving Specified Properties.
295-309
1996
68
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0070
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#BrunetNN96
2006-01-31
Nonhamiltonian Triangulations with Large Connectivity and Representativity.
45-55
1996
68
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0056
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#ArchdeaconHL96
2006-01-31
On Book-Complete Graph Ramsey Numbers.
36-44
1996
68
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0055
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#LiR96
2006-01-31
Asymptotics of the Chromatic Index for Multigraphs.
233-254
1996
68
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0067
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#Kahn96a
2006-01-31
The Order Upper Bound on Parity Embedding of a Graph.
149-160
1996
68
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0060
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#Zaslavsky96
2006-01-31
Cores and Compactness of Infinite Directed Graphs.
255-276
1996
68
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0068
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#Bauslaugh96
2006-01-31
A Pseudoconfiguration of Points without Adjoint.
277-294
1996
68
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0069
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#HochstattlerK96
2006-01-31
Twice Q-Polynomial Distance-Regular Graphs.
161-166
1996
68
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0061
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#Dickie96
2006-01-31
On the Number of Edges of Quadrilateral-Free Graphs.
1-6
1996
68
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0052
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#Furedi96b
2006-01-31
Intrinsic Chirality of 3-Connected Graphs.
223-232
1996
68
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0066
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#FlapanW96
2006-01-31
Ends and Multi-endings, II.
56-86
1996
68
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0057
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#Polat96
2006-01-31
Planar Graphs on Nonplanar Surfaces.
87-111
1996
68
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0058
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#MoharR96
2006-01-31
Multicolored Trees in Complete Graphs.
310-313
1996
68
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0071
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#BrualdiH96
2006-01-31
Systems of Curves on Surfaces.
7-22
1996
68
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0053
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#JuvanMM96
2006-01-31
Irreducible Triangulations of Surfaces.
206-217
1996
68
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0064
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#GaoRS96
2006-01-31
Disjoint Essential Cycles.
324-349
1996
68
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0073
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#MoharR96a
2006-01-31
Knots and Links in Certain Spatial Complete Graphs.
23-35
1996
68
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0054
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#Otsuki96
2006-01-31
Graph Minors: XV. Giant Steps.
112-148
1996
68
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0059
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#RobertsonS96
2006-01-31
Partitioning by Monochromatic Trees.
218-222
1996
68
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0065
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#HaxellK96
2006-01-31
Connected Spanning Subgraphs of 3-Connected Planar Graphs.
314-323
1996
68
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0072
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#EnomotoIO96
2006-01-31
Locally Pseudo-Distance-Regular Graphs.
179-205
1996
68
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0063
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb68.html#FiolGY96
2006-01-31
Graphs Where Every Maximal Path Is Maximum.
304-324
1996
67
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0048
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#Tarsi96
2006-01-31
Irreducible Quadrangulations of the Torus.
183-201
1996
67
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0040
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#Nakamoto96
2006-01-31
Diagonal Transformations and Cycle Parities of Quadrangulations on Surfaces.
202-211
1996
67
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0041
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#Nakamoto96a
2006-01-31
<i>b</i><sub><i>t</i></sub>=1 and Antipodal Double-Covers.
278-283
1996
67
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0045
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#ArayaHJ96
2006-01-31
On Inequivalent Representations of Matroids over Finite Fields.
325-343
1996
67
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0049
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#OxleyVW96
2006-01-31
Outerplanar Partitions of Planar Graphs.
238-248
1996
67
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0043
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#Kedlaya96
2006-01-31
Hamilton Cycles in Planar Graphs and Venn Diagrams.
296-303
1996
67
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0047
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#ChilakamarriHP96
2006-01-31
<i>k</i>-Core in a Random Graph.
111-151
1996
67
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0036
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#PittelSW96
2006-01-31
<i>P</i><sub>4</sub>-Structure of Perfect Graphs V. Overlap Graphs.
212-237
1996
67
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0042
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#HoangHM96
2006-01-31
On the Maximum Number of Independent Cycles in a Bipartite Graph.
152-164
1996
67
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0037
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#Wang96
2006-01-31
<i>beta</i>-Perfect Graphs.
1-11
1996
67
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0030
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#MarkossianGR96
2006-01-31
On a Class of Polynomials and Its Relation with the Spectra and Diameters of Graphs.
48-61
1996
67
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0033
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#FiolGY96a
2006-01-31
Geodesics in Transitive Graphs.
12-33
1996
67
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0031
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#BonningtonIS96
2006-01-31
Ends and Multi-Endings, I.
86-110
1996
67
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0035
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#Polat96a
2006-01-31
Spin Models on Triangle-Free Connected Graphs.
284-295
1996
67
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0046
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#Nomura96
2006-01-31
Snarks without Small Cycles.
34-47
1996
67
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0032
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#Kochol96
2006-01-31
On Critical Edges in Minimal Imperfect Graphs.
62-85
1996
67
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0034
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#Sebo96
2006-01-31
Hamiltonian Square-Paths.
167-182
1996
67
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0039
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#FanK96
2006-01-31
Regular Embeddings of Canonical Double Coverings of Graphs.
249-277
1996
67
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0044
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb67.html#NedelaS96
2006-01-31
Well-Covered Claw-Free Graphs.
293-302
1996
66
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0022
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#TankusT96
2006-01-31
<i>H</i>-Factors in Dense Graphs.
269-282
1996
66
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0020
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#AlonY96
2006-01-31
Note on the Colored Tverberg Theorem.
146-151
1996
66
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0011
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#Matousek96
2006-01-31
Polyhedra of Small Order and Their Hamiltonian Properties.
87-122
1996
66
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#Dillencourt96
2006-01-31
Bipartite Distance-Regular Graphs with an Eigenvalue of Multiplicity \itk\rm.
34-37
1996
66
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#Yamazaki96
2006-01-31
Dichromatic Sums Revisited.
161-167
1996
66
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0014
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#Tutte96
2006-01-31
Excluding a Long Double Path Minor.
11-23
1996
66
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#Ding96
2006-01-31
Vertex-Switching Reconstruction and Folded Cubes.
361-364
1996
66
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0027
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#Ellingham96
2006-01-31
A Class of Matchings and a Related Lattice.
1-10
1996
66
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#Kilakos96
2006-01-31
Proof of a Conjecture of Bollob's on Nested Cycles.
38-43
1996
66
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#ChenES96
2006-01-31
Separating and Nonseparating Disjoint Homotopic Cycles in Graph Embeddings.
201-231
1996
66
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0016
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#BrunetMR96
2006-01-31
<i>P</i><sub>3</sub>-Structure: A Switching Approach.
247-262
1996
66
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0018
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#Hayward96
2006-01-31
Vertex-Disjoint Cycles of the Same Length.
168-200
1996
66
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0015
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#Egawa96
2006-01-31
A Proof of a Conjecture of Bondy Concerning Paths in Weighted Digraphs.
283-292
1996
66
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0021
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#BollobasS96
2006-01-31
Directed Cycles with Two Chords and Strong Spanning Directed Subgraphs with Few Arcs.
24-33
1996
66
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#Thomassen96
2006-05-19
Unavoidable Minors of Large 3-Connected Binary Matroids.
334-360
1996
66
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0026
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#DingOOV96
2006-01-31
<i>K</i><sub>4</sub>and[formula].
263-268
1996
66
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0019
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#CarvalhoL96
2006-01-31
The Maximum Number of Triangles in Arrangements of Pseudolines.
44-74
1996
66
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#Roudneff96
2006-01-31
Accessibility and Ends of Graphs.
303-309
1996
66
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0023
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#Moller96
2006-01-31
Supereulerian Graphs and the Petersen Graph.
123-139
1996
66
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0009
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#CatlinL96
2006-01-31
Covering the Edges of a Connected Graph by Paths.
152-159
1996
66
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0012
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#Pyber96
2006-01-31
On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree.
324-333
1996
66
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0025
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#LuczakR96
2006-01-31
Hamiltonian Decompositions of Cayley Graphs on Abelian Groups of Odd Order.
75-86
1996
66
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#Liu96
2006-01-31
Orthogonal A-Trails of 4-Regular Graphs Embedded in Surfaces of Low Genus.
232-246
1996
66
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0017
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#AndersenBJ96
2006-01-31
A Complete Solution of a Problem of Bondy Concerning Multipartite Tournaments.
140-145
1996
66
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1996.0010
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#GuoV96
2006-01-31
Entropy Splitting Hypergraphs.
310-323
1996
66
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1996.0024
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb66.html#Simonyi96
2006-01-31
A Characterization of the Doob Graphs.
125-138
1995
65
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1046
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#Koolen95
2006-01-31
Well Quasi Ordering Finite Posets and Formal Languages.
111-124
1995
65
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1045
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#Gustedt95
2006-01-31
On a Minor-Monotone Graph Invariant.
291-304
1995
65
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1056
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#VanderholstLS95
2006-02-01
On the Cover Polynomial of a Digraph.
273-290
1995
65
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1055
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#ChungG95
2006-01-31
An Abstract Generalization of a Map Reduction Theorem of Birkhoff.
165-185
1995
65
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1049
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#StiebitzT95
2006-01-31
Graph Miners .XIV. Extending an Embedding.
23-50
1995
65
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1042
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#RobertsonS95
2006-01-31
Toughness and Triangle-Free Graphs.
208-221
1995
65
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1051
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#BauerHS95
2006-01-31
Circuit Coverings of Graphs and a Conjecture of Pyber.
1-6
1995
65
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1040
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#Fan95
2006-01-31
A Short Proof of the Planarity Characterization of Colin de Verdière.
269-272
1995
65
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1054
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#Vanderholst95
2006-01-31
A Characterization of Box 1/d-Integral Binary Clutters.
186-207
1995
65
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1050
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#GerardsL95
2006-01-31
11/30 (Finding Large Independent Sets in Connected Triangle-Free 3-Regular Graphs).
51-72
1995
65
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1043
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#FraughnaughL95
2006-01-31
<i>GF</i>(3) and the Rationals.
222-261
1995
65
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1052
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#Whittle95
2006-01-31
Three-Coloring Graphs Embedded on Surfaces with All Faces Even-Sided.
139-155
1995
65
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1047
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#Hutchinson95
2006-01-31
On the Spectral Radius and the Genus of Graphs.
262-268
1995
65
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1053
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#Yuan95
2006-01-31
Minimal Edge-Coverings of Pairs of Sets.
73-110
1995
65
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1044
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#FrankJ95
2006-01-31
Spanning Planar Subgraphs of Graphs in the Torus and Klein Bottle.
7-22
1995
65
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1041
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#BrunetEGMR95
2006-01-31
A Characterization of Some Graph Classes with No Long Holes.
156-162
1995
65
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1048
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#EschenS95
2006-01-31
Decomposing a Planar Graph into Degenerate Graphs.
305-314
1995
65
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1057
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb65.html#Thomassen95
2006-01-31
Sachs' Linkless Embedding Conjecture.
185-227
1995
64
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1032
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb64.html#RobertsonST95b
2006-01-31
An Extremal Result for Subgraphs with Few Edges.
288-299
1995
64
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1036
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb64.html#Brandt95
2006-01-31
Petersen Family Minors.
155-184
1995
64
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1031
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb64.html#RobertsonST95a
2006-01-31
Five Cycle Double Covers of Some Cubic Graphs.
119-125
1995
64
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1029
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb64.html#HuckK95
2006-01-31
Biased Graphs .III. Chromatic and Dichromatic Invariants.
17-88
1995
64
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1025
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb64.html#Zaslavsky95
2006-01-31
Kuratowski Chains.
127-154
1995
64
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1030
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb64.html#RobertsonST95
2006-01-31
Hamilton Cycle Decomposition of Line Graphs and a Conjecture of Bermond.
1-16
1995
64
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1024
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb64.html#MuthusamyP95
2006-01-31
Graph Minors .XII. Distance on a Surface.
240-272
1995
64
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1034
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb64.html#RobertsonS95a
2006-01-31
A Note on Graphical Partitions.
314-318
1995
64
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1038
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb64.html#RousseauA95
2006-01-31
Spin Models on Bipartite Distance-Regular Graphs.
300-313
1995
64
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1037
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb64.html#Nomura95a
2006-04-27
Linear Sets with Five Distinct Differences among Any Four Elements.
108-118
1995
64
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1028
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb64.html#GyarfasL95
2006-01-31
Graphs of Prescribed Girth and Bi-Degree.
228-239
1995
64
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1033
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb64.html#FurediLSUW95
2006-01-31
Extremal Graphs for Intersecting Triangles.
89-100
1995
64
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1026
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb64.html#ErdosFGG95
2006-01-31
3-List-Coloring Planar Graphs of Girth 5.
101-107
1995
64
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1027
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb64.html#Thomassen95a
2006-01-31
Turán's Extremal Problem in Random Graphs: Forbidding Even Cycles.
273-287
1995
64
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1035
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb64.html#HaxellKL95
2006-01-31
Weakly Hamiltonian-Connected Vertices in Bipartite Tournaments.
261-280
1995
63
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1019
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#Bang-JensenM95
2006-01-31
The Signed Chromatic Number of the Projective Plane and Klein Bottle and Antipodal Graph Coloring.
136-145
1995
63
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1009
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#Zaslavsky95a
2006-01-31
On the Optimal Vertex-Connectivity Augmentation.
8-20
1995
63
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#Jordan95
2006-01-31
Graph Minors .XIII. The Disjoint Paths Problem.
65-110
1995
63
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#RobertsonS95b
2006-01-31
On Infinite Antichains of Matroids.
21-40
1995
63
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#DingOO95
2006-01-31
The List Chromatic Index of a Bipartite Multigraph.
153-158
1995
63
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1011
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#Galvin95
2006-01-31
On Locally Hoffman-Singleton Graphs.
159-161
1995
63
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1012
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#Bon95
2006-01-31
On the Edge Distribution in Triangle-free Graphs.
245-260
1995
63
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1018
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#Krivelevich95
2006-01-31
Factorizations of 4-Regular Graphs and Petersen's Theorem.
170-184
1995
63
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1014
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#KouiderS95
2006-01-31
Universal Graphs without Large Cliques.
125-135
1995
63
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#KomjathS95
2006-01-31
Graph Decompositions without Isolated Vertices.
111-124
1995
63
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#Enomoto95
2006-01-31
Periodic Ordered Permutation Groups and Cyclic Orderings.
310-321
1995
63
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1022
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#DrosteGM95
2006-01-31
Dense Graphs with Cycle Neighborhoods.
281-293
1995
63
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1020
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#SeressS95
2006-01-31
The Square of Paths and Cycles.
55-64
1995
63
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#FanK95
2006-01-31
On the Structure of Local Tournaments.
200-221
1995
63
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1016
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#Huang95
2006-01-31
<i>K</i><sub><i>d</i></sub>-Free Graphs.
163-169
1995
63
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1013
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#JacksonW95
2006-01-31
Split-Neighborhood Graphs and the Strong Perfect Graph Conjecture.
294-309
1995
63
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1021
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#MaffrayP95
2006-01-31
Direct Sum Decompositions of Matroids and Exponential Structures.
222-244
1995
63
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1017
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#Welker95a
2006-01-31
Sparse Anti-Ramsey Graphs.
146-152
1995
63
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1010
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#KohayakawaL95
2006-01-31
Almost All Maps Are Asymmetric.
1-7
1995
63
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#RichmondW95
2006-01-31
Dense Graphs without 3-Regular Subgraphs.
41-54
1995
63
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1995.1004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#PyberRS95
2006-01-31
Tight and Untight Triangulations of Surfaces by Complete Graphs.
185-199
1995
63
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1995.1015
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb63.html#ArochaBN95
2006-01-31
Merging in Antipodal Distance-Regular Graphs.
228-235
1994
62
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1066
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#Jurisic94
2006-01-31
On 3-Transitive Graphs of Girth 6.
316-322
1994
62
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1072
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#Ching94
2006-01-31
2-Walks in Circuit Graphs.
259-267
1994
62
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1068
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#GaoR94
2006-01-31
Chromatic and Flow Polynomials for Directed Graphs.
349-362
1994
62
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1074
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#ArrowsmithE94
2006-01-31
Matchable Infinite Graphs.
213-227
1994
62
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1065
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#NiedermeyerP94
2006-01-31
4-Connected Projective-Planar Graphs Are Hamiltonian.
114-132
1994
62
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1058
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#ThomasY94
2006-01-31
Quickly Excluding a Planar Graph.
323-348
1994
62
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1073
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#RobertsonST94
2006-01-31
Packing Odd Paths.
280-288
1994
62
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1070
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#SchrijverS94
2006-01-31
An Orientation Theorem for Graphs.
199-212
1994
62
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1064
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#Gerards94
2006-01-31
Hamilton Cycles in a Class of Random Directed Graphs.
151-163
1994
62
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1060
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#CooperF94
2006-01-31
Topological Ramsey Theorem for Complete Bipartite Graphs.
164-179
1994
62
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1061
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#Miyauchi94
2006-01-31
Abstract and Generic Rigidity in the Plane.
107-113
1994
62
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1057
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#PatkarSS94
2006-01-31
Set-Homogeneous Graphs.
63-95
1994
62
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1055
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#DrosteMSG94
2006-01-31
<i>q</i><i>q</i>.
44-62
1994
62
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1054
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#Morgenstern94
2006-01-31
Grötzsch's 3-Color Theorem and Its Counterparts for the Torus and the Projective Plane.
268-279
1994
62
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1069
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#Thomassen94b
2006-01-31
Every Planar Graph Is 5-Choosable.
180-181
1994
62
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1062
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#Thomassen94a
2006-01-31
<i>T</i><i>T</i>-Cuts.
1-10
1994
62
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1051
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#Korach94
2006-01-31
Cycles in Multipartite Tournaments.
363-366
1994
62
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1075
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#GuoV94
2006-01-31
Intersection Graphs of Segments.
289-315
1994
62
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1071
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#KratochvilM94
2006-01-31
Investigation on Interval Edge-Colorings of Graphs.
34-43
1994
62
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1053
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#AsratianK94
2006-01-31
Five-Coloring Graphs on the Torus.
11-33
1994
62
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1052
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#Thomassen94
2006-09-01
Hamilton Cycles in 2-Connected Regular Bipartite Graphs.
236-258
1994
62
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1067
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#JacksonL94
2006-02-01
Chordal Completions of Planar Graphs.
96-106
1994
62
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1056
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#ChungM94
2006-01-31
Bipartite Graphs and Inverse Sign Patterns of Strong Sign-Nonsingular Matrices.
133-150
1994
62
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1059
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#BrualdiCS94
2006-01-31
On Reconstructing Rooted Trees.
183-198
1994
62
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1063
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb62.html#Andreae94
2006-01-31
<i>T</i>-Cuts.
263-271
1994
61
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1049
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#FrankS94
2006-05-23
2-Connected Spanning Subgraphs of Planar 3-Connected Graphs.
210-216
1994
61
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1045
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#Barnette94
2006-01-31
Spanning Trees in Locally Planar Triangulations.
178-198
1994
61
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1043
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#EllinghamG94
2006-01-31
<i>k</i><sub><i>i</i></sub><i>k</i><sub><i>j</i></sub>.
103-110
1994
61
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1035
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#Suzuki94
2006-01-31
On the Size of Hereditary Classes of Graphs.
16-39
1994
61
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1027
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#ScheinermanZ94
2006-01-31
A Note on Hyperplane Generation.
88-91
1994
61
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1033
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#Seymour94
2006-01-31
The Asymptotic Behavior of Diameters in the Average.
167-177
1994
61
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1042
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#AhlswedeA94
2006-01-31
On a Conjecture of Rödl and Voigt.
199-209
1994
61
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1044
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#KomjathM94
2006-01-31
Linear Programming in Some Ramsey Problems.
125-132
1994
61
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1038
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#McKayR94
2006-01-31
Expansion of Centered Triangulations.
92-102
1994
61
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1034
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#BenardF94
2006-01-31
<i>H</i>-Coloring.
141-154
1994
61
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1040
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#Bauslaugh94
2006-01-31
<i>R</i><sup>3</sup>and in Thickened Surfaces: A New Determinant Formulation.
237-259
1994
61
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1047
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#JaegerKS94
2006-01-31
Fulkerson's Conjecture and Circuit Covers.
133-138
1994
61
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1039
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#FanR94
2006-01-31
Subtrees and Subforests of Graphs.
63-70
1994
61
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1030
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#Brandt94
2006-01-31
On the Total Heights of Random Rooted Binary Trees.
155-166
1994
61
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1041
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#Takacs94
2006-01-31
Classification of Minimal Graphs of Given Face-Width on the Torus.
217-236
1994
61
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1046
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#Schrijver94
2006-01-31
Equitable Coloring of Trees.
83-87
1994
61
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1032
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#ChenL94
2006-01-31
Grid Minors of Graphs on the Torus.
57-62
1994
61
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1029
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#GraafS94
2006-01-31
On the Decomposition of Cayley Color Graphs into Isomorphic Oriented Trees.
71-82
1994
61
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1031
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#Fink94
2006-01-31
A Lower Bound for the One-Chromatic Number of a Surface.
40-56
1994
61
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1028
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#Korzhik94
2006-01-31
<i>TK</i><sub>aleph0</sub>-Free Graphs.
260-262
1994
61
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1048
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#Diestel94
2006-01-31
<i>m</i><i>n</i>Vertices with Many Edges and Without Small Cycles.
111-117
1994
61
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1036
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#LazebnikUW94
2006-01-31
Local and Global Clique Numbers.
5-15
1994
61
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1026
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#LinialR94
2006-01-31
Completely Monotonic Rational Functions and Hall's Marriage Theorem.
118-124
1994
61
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1037
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#Ball94
2006-01-31
An Improvement of the Boshier-Nomura Bound.
1-4
1994
61
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1025
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb61.html#Hiraki94
2006-01-31
Paths and Metrics in a Planar Graph with Three or More Holes. I. Metrics.
1-18
1994
60
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#Karzanov94
2006-01-31
<i>k</i>-Cycle-Free Graphs.
293-298
1994
60
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1020
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#LazebnikUW94a
2006-01-31
Multiplicativity of Oriented Cycles.
239-253
1994
60
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1016
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#HellZZ94
2006-01-31
The Relative Maximum Genus of a Graph.
195-206
1994
60
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1013
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#Bonnington94
2006-01-31
Pancyclism and Bipancyclism of Hamiltonian Graphs.
159-168
1994
60
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1010
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#Zhang94
2006-07-20
Ideal 0, 1 Matrices.
145-157
1994
60
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1009
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#CornuejolsN94
2006-01-31
Paths and Metrics in a Planar Graph with Three or More Holes. II. Paths.
19-35
1994
60
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#Karzanov94a
2006-01-31
Circle Graph Obstructions.
107-144
1994
60
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#Bouchet94
2006-01-31
Graphs with a Cycle of Length Divisible by Three.
277-292
1994
60
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1019
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#ChenS94
2006-01-31
Coloring Graphs without Short Non-bounding Cycles.
268-276
1994
60
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1018
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#FiskM94
2006-01-31
Extremal Regular Graphs with Prescribed Odd Girth.
222-238
1994
60
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1015
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#Zhang94a
2006-01-31
Trees in Triangulations.
56-62
1994
60
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#Thomassen94c
2006-01-31
Distance-Transitivity in Infinite Graphs.
36-39
1994
60
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#Moller94
2006-01-31
More on Vertex-Switching Reconstruction.
40-55
1994
60
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#KrasikovR94
2006-01-31
<i>r</i>-Neighborhood Problem for Covering Digraphs.
254-267
1994
60
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1017
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#Jacobs94
2006-01-31
Cycles in Graphs with Prescribed Stability Number and Connectivity.
315-318
1994
60
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1023
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#Kouider94
2006-01-31
Homogeneous Graphs and Regular Near Polygons.
63-71
1994
60
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#Nomura94a
2006-01-31
Induced Circuits in Planar Graphs.
169-176
1994
60
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1011
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#McDiarmidRSS94
2006-01-31
Graph Minors. XI. Circuits on a Surface.
72-106
1994
60
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1994.1007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#RobertsonS94
2006-01-31
Contractile Triples in 3-Connected Graphs.
308-314
1994
60
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1022
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#McCuaigO94
2006-01-31
Shortest Circuit Covers of Cubic Graphs.
299-307
1994
60
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1021
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#Jackson94
2006-01-31
Small Circuit Double Covers of Cubic Multigraphs.
177-194
1994
60
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1012
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#LaiYZ94
2006-05-23
The Color-Degree Matrix and the Number of Multicolored Trees in Star Decompositions.
207-221
1994
60
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1994.1014
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb60.html#LiuS94
2006-02-01
Vertex-Primitive Graphs of Order a Product of Two Distinct Primes.
245-266
1993
59
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1068
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#PraegerX93
2006-02-01
Complete Multi-partite Cutsets in Minimal Imperfect Graphs.
191-198
1993
59
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1065
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#CornuejolsR93
2006-02-01
A Strengthening of Ben Rebea's Lemma.
35-40
1993
59
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1052
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#Fouquet93
2006-02-01
Steiner Complexes, Matroid Ports, and Shellability.
41-68
1993
59
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1053
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#Chari93
2006-02-01
Five-Coloring Maps on Surfaces.
89-105
1993
59
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1057
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#Thomassen93
2006-02-01
<i>Z</i><sup><i>n</i></sup><i>R</i><sup><i>n</i></sup>.
156-160
1993
59
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1061
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#Chilakamarri93
2006-02-01
<i>K</i><sub>4</sub>.
74-84
1993
59
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1055
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#SewellT93
2006-04-25
<i>d</i><i>d</i>+1.
736-738
2006
113
J. Comb. Theory, Ser. A
4
http://dx.doi.org/10.1016/j.jcta.2005.05.009
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#HaaseK06
2006-02-01
In-Tournament Digraphs.
267-287
1993
59
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1069
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#Bang-JensenHP93
2006-02-01
Efficient Subgraph Packing.
106-121
1993
59
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1058
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#LoeblP93
2006-02-01
Stable Set Bonding in Perfect Graphs and Parity Graphs.
1-14
1993
59
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1049
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#CorneilF93
2006-02-01
Flags and Whitney Numbers of Matroids.
85-88
1993
59
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1056
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#Kung93
2006-02-01
Automorphism Groups of Cayley Maps.
297-310
1993
59
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1071
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#Jajcay93
2006-02-01
A Note on Intertwines of Infinite Graphs.
69-73
1993
59
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1054
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#Oporowski93
2006-02-01
The Construction of Self-Dual Projective Polyhedra.
122-131
1993
59
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1059
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#ArchdeaconN93
2006-02-01
Integer Plane Multiflows with a Fixed Number of Demands.
163-171
1993
59
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1062
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#Sebo93
2006-02-01
A Characterization of Tutte Invariants of 2-Polymatroids.
210-244
1993
59
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1067
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#OxleyW93
2006-02-01
Finite Induced Graph Ramsey Theory: On Partitions of Subgraphs.
199-209
1993
59
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1066
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#GundersonRS93
2006-02-01
Finite Separating Sets in Locally Finite Graphs.
15-25
1993
59
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1050
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#JungW93
2006-02-01
Planar Ramsey Numbers.
288-296
1993
59
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1070
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#SteinbergT93
2006-02-01
Simple Perfect Squared Squares and 2 × 1 Squared Rectangles of Orders 21 to 24.
26-34
1993
59
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1051
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#Duijvestijn93
2006-02-01
A Tutte Polynomial for Partially Ordered Sets.
132-155
1993
59
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1060
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#Gordon93
2006-02-01
Local Strongly Arc-Connectivity in Regular Bipartite Digraphs.
188-190
1993
59
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1064
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#Xu93
2006-02-01
Vertex-Transitive Graphs and Accessibility.
248-268
1993
58
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1042
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#ThomassenW93
2006-02-01
The Girth of a Directed Distance-Regular Graph.
34-39
1993
58
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1028
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#LeonardN93
2006-02-01
On the Nash-Williams' Lemma in Graph Reconstruction Theory.
280-290
1993
58
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1044
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#Thatte93
2006-02-01
Generating Linear Extensions by Adjacent Transpositions.
58-64
1993
58
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1031
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#West93
2006-02-01
A Correlation Inequality Involving Stable Set and Chromatic Polynomials.
14-21
1993
58
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1026
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#Farr93
2006-02-01
Monochromatic Trees with Respect to Edge Partitions.
291-298
1993
58
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1045
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#RodlV93
2006-02-01
<i>N</i><i>N</i>+ 1.
185-196
1993
58
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1036
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#Sidorenko93
2006-02-01
<i>p</i>.
197-216
1993
58
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1037
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#WangX93
2006-02-01
Symmetric Graphs of Order a Product of Two Distinct Primes.
299-318
1993
58
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1046
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#PraegerWX93
2006-02-01
Disjoint Cycles in Directed Graphs on the Torus and the Klein Bottle.
40-45
1993
58
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1029
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#DingSS93
2006-02-01
The Coefficients of the Tutte Polynomial Are Not Unimodal.
240-242
1993
58
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1040
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#Schwarzler93
2006-02-01
<i>k</i><i>k</i>-Edge-Connected Graph.
225-239
1993
58
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1039
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#Cai93
2006-02-01
On Canonical Ramsey Numbers for Complete Graphs versus Paths.
1-13
1993
58
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1025
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#LefmannR93
2006-02-01
Automorphism Groups of Higher-Weight Dowling Geometries.
161-173
1993
58
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1034
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#Bonin93
2006-02-01
General Antifactors of Graphs.
174-184
1993
58
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1035
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#Sebo93a
2006-02-01
Graph Searching and a Min-Max Theorem for Tree-Width.
22-33
1993
58
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1027
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#SeymourT93
2006-02-01
Some Inequalities in Distance-Regular Graphs.
243-247
1993
58
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1041
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#Nomura93
2006-02-01
Tait's Flyping Conjecture for Well-Connected Links.
65-146
1993
58
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1032
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#Schrijver93
2006-02-01
<i>SL</i><sup><i>k</i></sup>).
46-57
1993
58
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1030
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#MarusicS93
2006-02-01
Graphs on the Torus and Geometry of Numbers.
147-158
1993
58
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1033
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#Schrijver93a
2006-02-01
<i>n</i>-Connected Graphs.
269-279
1993
58
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1043
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#Su93
2006-02-01
On Cycles in Multipartite Tournaments.
319-321
1993
58
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1047
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#Gutin93
2006-02-01
<i>k</i>.
217-224
1993
58
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1038
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb58.html#RichterT93
2006-10-24
Inversion of Cycle Index Sum Relations for 2- and 3-Connected Graphs.
289-308
1993
57
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1022
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#RobinsonW93
2006-02-01
Maximal Sets of 2-Factors and Hamiltonian Cycles.
69-76
1993
57
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#HoffmanRR93
2006-02-01
Duality and Minors of Secondary Polyhedra.
258-268
1993
57
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1020
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#BilleraGS93
2006-02-01
Typical Subgraphs of 3- and 4-Connected Graphs.
239-257
1993
57
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1019
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#OporowskiOT93
2006-02-01
Sharpened Bonferroni Inequalities.
131-137
1993
57
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1011
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#Grable93
2006-02-01
<i>R</i><i>t</i>).
150-155
1993
57
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1013
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#ChungCD93
2006-02-01
A Characterization of Well Covered Graphs of Girth 5 or Greater.
44-68
1993
57
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#FinbowHN93
2006-02-01
On Total Colorings of Graphs.
122-130
1993
57
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1010
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#McDiarmidR93
2006-02-01
Hamilton Cycles in Almost-Regular 2-Connected Graphs.
77-87
1993
57
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#Jackson93
2006-02-01
Kuratowski-Type Theorems for Average Genus.
100-121
1993
57
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1009
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#ChenG93
2006-02-01
Orthogonal Structures in Directed Graphs.
309-321
1993
57
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1023
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#Felsner93
2006-02-01
Illuminating Rectangles and Triangles in the Plane.
1-17
1993
57
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#CzyzowiczRU93
2006-02-01
The Matrix of Chromatic Joins.
269-288
1993
57
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1021
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#Tutte93
2006-02-01
Tutte's 3-Flow Conjecture and Short Cycle Covers.
36-43
1993
57
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#Fan93
2006-02-01
Graphs with Linearly Bounded Ramsey Numbers.
138-149
1993
57
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1012
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#ChenS93
2006-02-01
Distance-Regular Graphs with an Eigenvalue of Multiplicity Four.
157-182
1993
57
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1014
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#Zhu93
2006-02-01
Disjoint Paths in Acyclic Digraphs.
228-238
1993
57
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1018
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#Metzlar93
2006-02-01
Graph Invariants Related to Statistical Mechanical Models: Examples and Problems.
207-227
1993
57
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1017
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#HarpeJ93
2006-02-01
Complementary Cycles of All Lengths in Tournaments.
18-25
1993
57
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#Song93
2006-02-01
Triangulating a Surface with a Prescribed Graph.
196-206
1993
57
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1016
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#Thomassen93a
2006-02-01
The Edge-Orbit Conjecture of Babai.
26-35
1993
57
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#Goodman93
2006-02-01
When Do Short Cycles Generate the Cycle Space?
88-99
1993
57
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1006/jctb.1993.1008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#HartvigsenM93
2006-02-01
On the Shannon Capacity of Probabilistic Graphs.
183-195
1993
57
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1015
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb57.html#Marton93
2006-02-01
The second eigenvalue of regular graphs of given girth.
239-249
1992
56
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90020-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#Sole92
2006-02-01
Martin's axiom and spanning trees of infinite graphs.
141-144
1992
56
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90013-N
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#Komjath92
2006-02-01
Distance regular covers of the complete graph.
205-238
1992
56
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90019-T
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#GodsilH92
2006-02-01
Generating locally cyclic triangulations of surfaces.
147-164
1992
56
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90015-P
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#MalnicM92
2006-02-01
A characterization of unimodular orientations of simple graphs.
45-54
1992
56
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90005-I
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#Bouchet92
2006-02-01
On a conjecture of berge.
97-107
1992
56
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90010-U
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#MarkosianGM92
2006-02-01
Extensions of Tutte's wheels-and-whirls theorem.
130-140
1992
56
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90012-M
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#CoullardO92
2006-02-01
Limit points for average genus II. 2-Connected non-simplicial graphs.
108-129
1992
56
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90011-L
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#ChenG92
2006-02-01
Ramsey properties of random graphs.
55-68
1992
56
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90006-J
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#LuczakRV92
2006-02-01
Short cycle covers and the cycle double cover conjecture.
197-204
1992
56
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90018-S
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#JamshyT92
2006-02-01
Group connectivity of graphs - A nonhomogeneous analogue of nowhere-zero flow properties.
165-182
1992
56
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90016-Q
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#JaegerLPT92
2006-02-01
<i>k</i>-connectedness in infinite graphs.
263-277
1992
56
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90022-P
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#Diestel92
2006-02-01
On embedding of graphs into euclidean spaces of small dimension.
1-8
1992
56
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90002-F
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#ReitermanRS92
2006-02-01
On secret-sharing matroids.
69-73
1992
56
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90007-K
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#Seymour92
2006-02-01
<i>k</i>-connected cubic graphs.
16-44
1992
56
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90004-H
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#McCuaig92
2006-02-01
Factorizations of regular graphs.
74-89
1992
56
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90008-L
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#ZhangZ92
2006-02-01
An "average distance" inequality for large subsets of the cube.
296-301
1992
56
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90024-R
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#AlthoferS92
2006-02-01
<i>f</i>-factor-lattice of bipartite graphs.
90-96
1992
56
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90009-M
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#Rieder92
2006-02-01
On large induced trees and long induced paths in sparse random graphs.
250-262
1992
56
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90021-O
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#Suen92
2006-02-02
Dimensions of hypergraphs.
278-295
1992
56
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90023-Q
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#FishburnT92
2006-02-01
<i>g</i>.
183-196
1992
56
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90017-R
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#BermanP92
2006-02-01
A turán-type theorem on chords of a convex polygon.
9-15
1992
56
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90003-G
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb56.html#CapoyleasP92
2006-02-01
Submaps of maps. I. General 0-1 laws.
104-117
1992
55
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90034-U
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb55.html#BenderGR92
2006-02-01
On the uniqueness of kernels.
146-160
1992
55
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90038-Y
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb55.html#Schrijver92
2006-02-01
On obstructions to small face covers in planar graphs.
163-189
1992
55
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90040-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb55.html#BienstockD92
2006-02-01
<i>k</i>-connected planar cubic maps.
118-124
1992
55
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90035-V
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb55.html#BenderGMR92
2006-02-01
A decomposition theory for matroids. VII. Analysis of minimal violation matrices.
302-335
1992
55
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90045-Y
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb55.html#Truemper92a
2006-02-01
A decomposition theory for matroids. VI. Almost regular matroids.
253-301
1992
55
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90044-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb55.html#Truemper92
2006-02-01
On distance transitive graphs whose automorphism groups are affine.
190-235
1992
55
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90041-U
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb55.html#Yokoyama92
2006-02-01
Limit points for average genus. I. 3-Connected and 2-connected simplicial graphs.
83-103
1992
55
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90033-T
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb55.html#ChenG92a
2006-02-01
<i>T</i><i>T</i>-cuts.
73-82
1992
55
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90032-S
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb55.html#Gerards92
2006-02-01
Fractional matroid matchings.
133-145
1992
55
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90037-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb55.html#Vate92
2006-02-01
Kernels in perfect line-graphs.
1-8
1992
55
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90028-V
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb55.html#Maffray92
2006-02-01
On local routing of two-terminal nets.
33-72
1992
55
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90031-R
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb55.html#KaufmannM92
2006-02-01
Edge-disjoint circuits in graphs on the torus.
9-17
1992
55
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90029-W
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb55.html#FrankS92
2006-02-01
Pebbling graphs.
244-252
1992
55
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90043-W
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb55.html#Moews92
2006-02-01
Graph coloring in linear time.
236-243
1992
55
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90042-V
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb55.html#Tuza92
2006-02-01
Hamiltonian games.
18-32
1992
55
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90030-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb55.html#Lu92
2006-02-01
<i>k</i>-Connected nonplanar maps.
125-132
1992
55
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90036-W
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb55.html#BenderR92
2006-02-01
<sub>8</sub>is a counterexample to a clique covering conjecture.
157-160
1992
54
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90074-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#VinceW92
2006-02-01
Infinite connected graphs with no end-preserving spanning trees.
322-324
1992
54
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90059-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#Thomassen92
2006-02-01
The 2 and 3 representative projective planar embeddings.
1-12
1992
54
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90063-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#Vitray92
2006-02-01
<i>TK</i><sub><i>a</i></sub>-free graphs.
222-238
1992
54
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90054-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#Diestel92a
2006-02-01
Densely embedded graphs.
13-36
1992
54
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90064-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#Archdeacon92
2006-02-01
On the independence and chromatic numbers of random regular graphs.
123-132
1992
54
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90070-E
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#FriezeL92
2006-02-01
The asymptotic number of rooted 2-connected triangular maps on a surface.
102-112
1992
54
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90068-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#Gao92
2006-02-01
The matching extendability of surfaces.
133-141
1992
54
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90071-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#Dean92
2006-02-01
Self-dual embeddings of complete bipartite graphs.
249-256
1992
54
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90056-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#ArchdeaconH92
2006-02-01
Kuratowski-type theorems do not extend to pseudosurfaces.
209-212
1992
54
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90052-Y
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#SiranG92
2006-02-01
The construction and classification of self-dual spherical polyhedra.
37-63
1992
54
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90065-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#ArchdeaconR92
2006-02-01
Symmetric vertex partitions of hypercubes by isometric trees.
239-248
1992
54
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90055-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#Ramras92
2006-02-01
<i>R</i><sup>4</sup>.
161-165
1992
54
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90075-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#BokowskiR92
2006-02-01
On the strength of König's duality theorem for infinite bipartite graphs.
257-290
1992
54
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90057-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#AharoniMS92
2006-02-01
The double reconstruction conjecture about finite colored hypergraphs.
64-76
1992
54
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90066-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#Hashiguchi92
2006-02-01
Generating linear extensions of posets by transpositions.
77-101
1992
54
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90067-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#Ruskey92
2006-02-01
Integer flows and cycle covers.
113-122
1992
54
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90069-A
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#Fan92
2006-02-01
Uniquely squared squares of a common reduced side and order.
155-156
1992
54
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90073-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#Skinner92
2006-02-01
<i>f</i>-factors of graphs.
213-221
1992
54
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90053-Z
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#KanoT92
2006-02-01
Generalized local colorings of graphs.
178-188
1992
54
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90049-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#Truszczynski92
2006-02-01
Vertex-switching reconstruction of subgraph numbers and triangle-free graphs.
167-177
1992
54
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90048-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#EllinghamR92
2006-02-01
The variety of triangular embeddings of a graph in the projective plane.
196-208
1992
54
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90051-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#Lawrencenko92
2006-02-01
Longest cycles in 3-connected planar graphs.
291-321
1992
54
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90058-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#JacksonW92
2006-02-01
Non-separating cycles and discrete Jordan curves.
142-154
1992
54
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(92)90072-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#Yu92a
2006-02-01
Switching reconstruction and diophantine equations.
189-195
1992
54
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(92)90050-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb54.html#KrasikovR92
2006-02-01
Path Coverings of Graphs and Height Characteristics of Matrices.
172-187
1993
59
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1006/jctb.1993.1063
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb59.html#DH93
2006-04-25
Dedication.
1
2006
113
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.10.010
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#Barcelo06
2006-04-25
On stars and links of shellable polytopal complexes.
692-697
2006
113
J. Comb. Theory, Ser. A
4
http://dx.doi.org/10.1016/j.jcta.2005.05.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#Courdurier06
2006-04-26
Mono-multi bipartite Ramsey numbers, designs, and matrices.
101-112
2006
113
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.07.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#BalisterGLS06
2006-04-25
A signed analog of the Birkhoff transform.
251-272
2006
113
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.03.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#Hsiao06
2006-04-25
Infinite partitions of random graphs.
225-250
2006
113
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.03.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#Vuksanovic06
2006-04-26
<i>CCRR</i>tournaments.
352-379
2006
113
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.03.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#GeLL06
2006-04-25
Long arithmetic progressions in critical sets.
53-66
2006
113
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.02.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#Croot06
2006-04-25
Erdos-Szekeres theorem with forbidden order types.
455-465
2006
113
J. Comb. Theory, Ser. A
3
http://dx.doi.org/10.1016/j.jcta.2005.04.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#KarolyiS06
2006-04-25
Finite form of the quintuple product identity.
185-187
2006
113
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.04.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#ChenCG06
2006-04-25
<i>k</i><i>k</i><i>k</i>-1) designs.
703-711
2006
113
J. Comb. Theory, Ser. A
4
http://dx.doi.org/10.1016/j.jcta.2005.05.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#GreigHK06
2006-04-25
Colouring lines in projective space.
39-52
2006
113
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.01.010
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#ChowdhuryGR06
2006-04-25
Intersection reverse sequences and geometric applications.
675-691
2006
113
J. Comb. Theory, Ser. A
4
http://dx.doi.org/10.1016/j.jcta.2005.07.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#MarcusT06
2006-04-25
Applications of minor summation formula III, Plücker relations, lattice paths and Pfaffian identities.
113-155
2006
113
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.05.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#IshikawaW06
2006-04-25
Characteristic-independence of Betti numbers of graph ideals.
435-454
2006
113
J. Comb. Theory, Ser. A
3
http://dx.doi.org/10.1016/j.jcta.2005.04.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#Katzman06
2006-04-25
Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite.
520-546
2006
113
J. Comb. Theory, Ser. A
3
http://dx.doi.org/10.1016/j.jcta.2005.04.010
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#Rechnitzer06
2006-04-25
Left cells containing a fully commutative element.
556-565
2006
113
J. Comb. Theory, Ser. A
3
http://dx.doi.org/10.1016/j.jcta.2005.04.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#Shi06
2006-04-25
Special simplices and Gorenstein toric rings.
718-725
2006
113
J. Comb. Theory, Ser. A
4
http://dx.doi.org/10.1016/j.jcta.2005.06.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#OhsugiH06
2006-04-25
On Rado's Boundedness Conjecture.
84-100
2006
113
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.07.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#FoxK06
2006-04-25
New identities involving Bernoulli and Euler polynomials.
156-175
2006
113
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.07.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#PanS06
2006-04-25
Optimal tristance anticodes in certain graphs.
189-224
2006
113
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.01.012
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#EtzionSV06
2006-04-25
Minimal 1-saturating sets and complete caps in binary projective spaces.
647-663
2006
113
J. Comb. Theory, Ser. A
4
http://dx.doi.org/10.1016/j.jcta.2005.06.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#DavydovMP06
2006-04-25
Constructions of generalized Sidon sets.
591-607
2006
113
J. Comb. Theory, Ser. A
4
http://dx.doi.org/10.1016/j.jcta.2005.04.011
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#MartinO06
2006-04-25
The Angel and the Devil in three dimensions.
176-184
2006
113
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.03.009
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#BollobasL06
2006-04-25
The stationary measure of a 2-type totally asymmetric exclusion process.
625-635
2006
113
J. Comb. Theory, Ser. A
4
http://dx.doi.org/10.1016/j.jcta.2005.05.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#Angel06
2006-04-25
The mathematics of Bruce Rothschild.
2-20
2006
113
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.10.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#Hindman06
2006-04-25
On central difference sets in certain non-abelian 2-groups.
712-717
2006
113
J. Comb. Theory, Ser. A
4
http://dx.doi.org/10.1016/j.jcta.2005.05.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#GowQ06
2006-04-25
The largest strongly consecutive repeat-free code.
551-555
2006
113
J. Comb. Theory, Ser. A
3
http://dx.doi.org/10.1016/j.jcta.2005.04.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#Pebody06
2006-04-25
Asymptotic enumeration of sparse 0-1 matrices with irregular row and column sums.
291-324
2006
113
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.03.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#GreenhillMW06
2006-04-25
On empty convex polygons in a planar point set.
385-419
2006
113
J. Comb. Theory, Ser. A
3
http://dx.doi.org/10.1016/j.jcta.2005.03.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#PinchasiRS06
2006-09-12
New families of atomic Latin squares and perfect 1-factorisations.
608-624
2006
113
J. Comb. Theory, Ser. A
4
http://dx.doi.org/10.1016/j.jcta.2005.05.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#BryantMW06
2006-04-25
The rook partition algebra.
325-351
2006
113
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.03.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#Grood06
2006-04-25
A localization inequality for set functions.
726-735
2006
113
J. Comb. Theory, Ser. A
4
http://dx.doi.org/10.1016/j.jcta.2005.03.011
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#LovaszS06
2006-04-25
Partial flocks of the quadratic cone.
698-702
2006
113
J. Comb. Theory, Ser. A
4
http://dx.doi.org/10.1016/j.jcta.2005.04.012
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#Sziklai06
2006-04-25
<i>L</i>-system on the small Witt design.
420-434
2006
113
J. Comb. Theory, Ser. A
3
http://dx.doi.org/10.1016/j.jcta.2005.04.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#Tokushige06
2006-04-25
Locally singular hyperplanes in thick dual polar spaces of rank 4.
636-646
2006
113
J. Comb. Theory, Ser. A
4
http://dx.doi.org/10.1016/j.jcta.2005.05.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#CardinaliBP06
2006-04-25
Erdos-Ko-Rado for three sets.
547-550
2006
113
J. Comb. Theory, Ser. A
3
http://dx.doi.org/10.1016/j.jcta.2005.04.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#Mubayi06
2006-04-25
On the work of Basil Gordon.
21-38
2006
113
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.10.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#AlladiAOM06
2006-04-25
Inequalities between Littlewood-Richardson coefficients.
567-590
2006
113
J. Comb. Theory, Ser. A
4
http://dx.doi.org/10.1016/j.jcta.2005.05.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#BergeronBR06
2006-04-26
The Ramsey number for hypergraph cycles I.
67-83
2006
113
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.02.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#HaxelllPRRSS06
2006-04-25
Intersection theorems under dimension constraints.
483-519
2006
113
J. Comb. Theory, Ser. A
3
http://dx.doi.org/10.1016/j.jcta.2005.04.009
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#AhlswedeAK06
2006-04-25
<i>q</i>).
273-290
2006
113
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.03.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#BarwickBP06
2006-04-25
Hyper-bent functions and cyclic codes.
466-482
2006
113
J. Comb. Theory, Ser. A
3
http://dx.doi.org/10.1016/j.jcta.2005.04.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#CarletG06
2006-04-25
<i>difference function families</i>.
664-674
2006
113
J. Comb. Theory, Ser. A
4
http://dx.doi.org/10.1016/j.jcta.2005.07.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#TonienS06
2006-04-25
<i>n</i><i>epsilon</i>with unit squares.
380-383
2006
113
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.08.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta113.html#Soifer06
2006-04-28
Non-zero disjoint cycles in highly connected group labelled graphs.
296-301
2006
96
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.08.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#KawarabayashiW06
2006-04-28
Arboricity and tree-packing in locally finite graphs.
302-312
2006
96
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.08.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#Stein06
2006-04-28
A linear programming formulation of Mader's edge-disjoint paths problem.
159-163
2006
96
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.07.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#KeijsperPS06
2006-04-28
A Tutte decomposition for matrices and bimatroids.
50-66
2006
96
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.06.009
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#Kung06
2006-04-28
<i>kappa</i>-connected graph.
276-295
2006
96
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.07.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#JianjiX06
2006-04-28
The Bergman complex of a matroid and phylogenetic trees.
38-49
2006
96
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.06.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#ArdilaK06
2006-04-28
MacLane's planarity criterion for locally finite graphs.
225-239
2006
96
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.07.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#BruhnS06
2006-04-28
A class of perfectly contractile graphs.
1-19
2006
96
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.06.011
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#MaffrayT06
2006-04-28
Tetravalent edge-transitive Cayley graphs with odd number of vertices.
164-181
2006
96
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.07.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#LiLZ06
2006-04-28
A map colour theorem for the union of graphs.
20-37
2006
96
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.06.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#StiebitzS06
2006-04-28
Some new evaluations of the Tutte polynomial.
207-224
2006
96
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.07.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#Goodall06
2006-04-28
Cycle double covers and spanning minors I.
183-206
2006
96
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.07.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#HaggkvistM06
2006-05-19
Matroid packing and covering with circuits through an element.
135-158
2006
96
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.07.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#LemosO06
2006-04-28
Spectral estimates for Abelian Cayley graphs.
111-121
2006
96
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.06.012
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#FriedmanMT06
2006-04-28
Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets.
67-72
2006
96
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.06.010
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#Feng06
2006-04-28
A hypergraph extension of Turán's theorem.
122-134
2006
96
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.06.013
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#Mubayi06a
2006-04-28
Extending partial 5-colorings and 6-colorings in planar graphs.
100-110
2006
96
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.06.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#Kral06
2006-04-28
Extremal connectivity for topological cliques in bipartite graphs.
73-99
2006
96
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.06.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#KuhnO06
2006-04-28
<i>K</i><sub>9</sub>minors.
240-252
2006
96
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.07.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#SongT06
2006-04-28
Independent sets in triangle-free cubic planar graphs.
253-275
2006
96
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.07.009
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb96.html#HeckmanT06
2006-05-05
<i>V</i><sub>2</sub><sup>4</sup>.
217-221
2005
110
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.10.009
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#ThasM05
2006-05-05
Hypergraphs and a functional equation of Bouwkamp and de Bruijn.
275-289
2005
110
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.11.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#GesselK05
2006-05-05
Affine distance-transitive graphs and classical groups.
291-335
2005
110
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.11.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#BonCC05
2006-05-05
Lattice congruences, fans and Hopf algebras.
237-273
2005
110
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.11.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#Reading05
2006-05-05
One-point suspensions and wreath products of polytopes and spheres.
193-216
2005
110
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.09.009
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#JoswigL05
2006-05-05
Relative difference sets in Alt(5).
179-191
2005
110
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.07.013
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#Hiramine05
2006-05-05
The limit of a Stanley-Wilf sequence is not always rational, and layered patterns beat monotone patterns.
223-235
2005
110
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.07.014
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#Bona05
2006-05-05
Evacuation and a geometric construction for Fibonacci tableaux.
337-351
2005
110
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.11.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta110.html#Killpatrick05
2006-05-05
Sieve methods in combinatorics.
1-23
2005
111
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.11.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#LiuM05
2006-05-05
Crossing patterns of semi-algebraic sets.
310-326
2005
111
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.12.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#AlonPPRS05
2006-05-05
On 0-1 matrices and small excluded submatrices.
266-288
2005
111
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.11.015
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#Tardos05
2006-05-05
A method for proving polynomial enumeration formulas.
37-58
2005
111
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.11.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#Fischer05
2006-05-05
Non-uniform Turán-type problems.
106-110
2005
111
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.11.010
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#MubayiZ05
2006-05-05
<i>WI</i><i>Z</i><sub>2</sub>-equivalences.
204-223
2005
111
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.12.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#Zivaljevic05
2006-05-05
Ehrhart polynomials of cyclic polytopes.
111-127
2005
111
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.11.011
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#Liu05
2006-05-05
A direct bijection for the Harer-Zagier formula.
224-238
2005
111
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.12.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#GouldenN05
2006-05-05
Relative difference sets fixed by inversion and Cayley graphs.
165-173
2005
111
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.09.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#ChenL05
2006-05-05
Shifted products that are coprime pure powers.
24-36
2005
111
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.11.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#DietmannEGS05
2006-05-05
A criterion on the semisimple Brauer algebras.
78-88
2005
111
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.11.009
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#Rui05
2006-05-05
Self-duality of chiral polytopes.
128-136
2005
111
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.11.012
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#HubardW05
2006-05-05
Klarner systems and tiling boxes with polyominoes.
89-105
2005
111
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.10.010
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#Reid05
2006-05-05
Large sum-free sets in ternary spaces.
337-346
2005
111
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.01.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#Lev05
2006-05-05
The Turán problem for projective geometries.
289-309
2005
111
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.12.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#Keevash05
2006-05-05
On sharply vertex transitive 2-factorizations of the complete graph.
245-256
2005
111
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.11.014
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#BurattiR05
2006-05-05
Maximal continuants and the Fine-Wilf theorem.
59-77
2005
111
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.11.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#Ramharter05
2006-05-05
Relative difference sets fixed by inversion (ii) - character theoretical approach.
175-189
2005
111
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.09.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#LiuCH05
2006-05-05
An arctic circle theorem for Groves.
137-164
2005
111
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.11.013
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#PetersenS05
2006-05-05
On inductively minimal geometries that satisfy the intersection property.
327-330
2005
111
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.12.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#CaraL05
2006-05-05
A Katona-type proof of an Erdos-Ko-Rado-type theorem.
239-244
2005
111
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.12.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#Friedgut05
2006-05-05
<i>A</i><i>B</i><i>C</i><i>D</i>.
331-336
2005
111
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.01.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#BonisKS05
2006-05-05
A constructive proof of Ky Fan's generalization of Tucker's lemma.
257-265
2005
111
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.12.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#PrescottS05
2006-05-05
On the sign-imbalance of partition shapes.
190-203
2005
111
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2004.12.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta111.html#Sjostrand05
2006-05-05
Refined Chung-Feller theorems for lattice paths.
143-162
2005
112
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2004.11.016
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#EuFY05
2006-05-05
A new existence proof for large sets of disjoint Steiner triple systems.
308-327
2005
112
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.06.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#Ji05
2006-05-05
Generalized triangulations and diagonal-free subsets of stack polyominoes.
117-142
2005
112
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.01.009
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#Jonsson05
2006-05-05
Discrete strip-concave functions, Gelfand-Tsetlin patterns, and related polyhedra.
175-193
2005
112
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.01.011
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#DanilovKK05
2006-05-05
<i>n</i><i>n</i>+3 vertices": [J. Combin. Theory Ser. A 102 (2003) 401-409].
173-174
2005
112
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.06.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#KleinW05
2006-05-05
<i>n</i><i>n</i>distinct squares.
163-164
2005
112
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.01.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#Ilie05
2006-05-05
Monochrome symmetric subsets of colored groups.
212-221
2005
112
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.02.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#GryshkoK05
2006-05-05
Robinson-Schensted algorithm and Vogan equivalence.
165-172
2005
112
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.01.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#Du05
2006-05-05
Valuations and hyperplanes of dual polar spaces.
194-211
2005
112
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.02.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#BruynV05
2006-09-25
Bounds for the growth rate of meander numbers.
250-262
2005
112
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.02.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#AlbertP05
2006-05-05
The Topological Tverberg Theorem and winding numbers.
82-104
2005
112
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.01.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#SchonebornZ05
2006-05-05
Dissecting the Stanley partition function.
277-291
2005
112
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.03.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#BerkovichG05
2006-05-05
<i>q</i>-ary linear codes.
337-346
2005
112
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.08.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#Hou05a
2006-05-05
Disjunctive Rado numbers.
263-276
2005
112
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.02.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#JohnsonS05
2006-05-05
Rook numbers and the normal ordering problem.
292-307
2005
112
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.07.012
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#Varvak05
2006-05-05
The number of spanning trees of plane graphs with reflective symmetry.
105-116
2005
112
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.01.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#CiucuYZ05
2006-05-05
<i>k</i><i>k</i>-Schur expansions.
44-81
2005
112
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.01.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#LapointeM05
2006-05-05
Effective scalar products of D-finite symmetric functions.
1-43
2005
112
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/j.jcta.2005.01.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#ChyzakMS05
2006-05-05
The Rényi-Ulam pathological liar game with a fixed number of lies.
328-336
2005
112
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.02.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#EllisPY05
2006-05-05
A unique factorization theorem for matroids.
222-249
2005
112
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/j.jcta.2005.02.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta112.html#CrapoS05
2006-05-05
Aztec diamonds and digraphs, and Hankel determinants of Schröder numbers.
334-351
2005
94
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.02.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb94.html#BrualdiK05
2006-05-05
Decompositions of infinite graphs: I - bond-faithful decompositions.
259-277
2005
94
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.01.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb94.html#Laviolette05
2006-05-05
Hamilton paths in toroidal graphs.
214-236
2005
94
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.01.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb94.html#ThomasYZ05
2006-05-05
Corrigendum to Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs: [J. Combin. Theory Ser. B 91 (2004) 301-325].
352-353
2005
94
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.02.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb94.html#DengLZ05
2006-05-05
A bound on the chromatic number of the square of a planar graph.
189-213
2005
94
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2004.12.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb94.html#MolloyS05
2006-05-05
Decompositions of infinite graphs: Part II circuit decompositions.
278-333
2005
94
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.01.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb94.html#Laviolette05a
2006-05-05
Vertex colouring edge partitions.
237-244
2005
94
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.01.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb94.html#Addario-BerryADR05
2006-05-05
Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency.
245-258
2005
94
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.01.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb94.html#JurisicKM05
2006-05-05
Local chromatic number and Sperner capacity.
101-117
2005
95
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.03.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#KornerPS05
2006-05-05
<i>k</i>edge-disjoint 2-connected spanning subgraphs.
257-262
2005
95
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.04.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#Jordan05
2006-05-05
<i>K</i><sub><i>k</i></sub><i>K</i><sub><i>k</i></sub>-decompositions.
1-11
2005
95
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.02.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#Yuster05
2006-05-05
<i>chi</i>-coloring complex.
346-349
2005
95
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.06.008
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#HooryL05
2006-05-05
An equitable partition for a distance-regular graph of negative type.
175-188
2005
95
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.02.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#Miklavic05
2006-05-05
A jump to the bell number for hereditary graph properties.
29-48
2005
95
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.02.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#BaloghBW05
2006-05-05
Tait's flyping conjecture for 4-regular graphs.
318-332
2005
95
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.05.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#Sawollek05
2006-05-05
<i>K</i><sub>8</sub><sup>-</sup>minors.
300-317
2005
95
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.04.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#Song05
2006-05-05
<i>d</i>-dimensional rigidity matroid of sparse graphs.
118-133
2005
95
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.03.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#JacksonJ05b
2006-05-05
A polynomial recognition algorithm for balanced matrices.
49-67
2005
95
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.02.006
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#Zambelli05
2006-05-05
Multiplicative graphs and semi-lattice endomorphisms in the category of graphs.
338-345
2005
95
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.06.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#Tardif05
2006-05-05
Large planar subgraphs in dense graphs.
263-282
2005
95
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.04.004
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#KuhnOT05
2006-05-05
Disjoint representability of sets and their complements.
12-28
2005
95
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.02.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#BaloghKS05
2006-05-05
Covering arrays on graphs.
134-151
2005
95
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.03.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#MeagherS05
2006-05-05
Cayley maps.
189-245
2005
95
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.04.007
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#RichterSJTW05
2006-05-05
Delta+300 is a bound on the adjacent vertex distinguishing edge chromatic number.
246-256
2005
95
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.04.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#Hatami05a
2006-05-05
<i>A</i>-paths in digraphs.
168-172
2005
95
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.03.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#Kriesell05
2006-05-05
Rank-width and vertex-minors.
79-100
2005
95
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.03.003
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#Oum05
2006-05-23
Monotone maps, sphericity and bounded second eigenvalue.
283-299
2005
95
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.04.005
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#BiluL05
2006-05-05
The co-degree density of the Fano plane.
333-337
2005
95
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/j.jctb.2005.06.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#Mubayi05
2006-06-27
Deeply asymmetric planar graphs.
68-78
2005
95
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.03.002
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#AksionovBMSST05
2006-05-05
Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture.
152-167
2005
95
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/j.jctb.2005.04.001
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb95.html#KawarabayashiPT05
2006-05-23
The non-neighbourliness of centrally symmetric convex polytopes having many vertices.
321-322
1991
58
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90067-Q
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#Burton91
2006-05-23
On partition regular systems of equations.
35-53
1991
58
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90072-O
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#Lefmann91
2006-05-23
Areas of lattice figures in the planar tilings with congruent regular polygons.
115-126
1991
58
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90076-S
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#Koodziejczyk91
2006-05-23
Über die Schnittzahlen mehrfach balancierter blockpläne.
141-146
1991
58
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90080-Z
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#Klemm91
2006-05-23
Homogene multiplikationen.
198-255
1991
58
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90060-T
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#Strambach91
2006-05-23
Tableaux de young et solitaire bulgare.
181-197
1991
58
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90059-P
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#Etienne91
2006-05-23
Four mutually orthogonal Latin squares of orders 28 and 52.
306-309
1991
58
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90064-N
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#Abel91
2006-05-23
Permutation statistics and linear extensions of posets.
85-114
1991
58
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90075-R
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#BjornerW91
2006-05-23
A bound for the collinearity graph of certain locally polar geometries.
127-130
1991
58
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90077-T
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#Pasini91
2006-05-23
A simpler proof and a generalization of the zero-trees theorem.
301-305
1991
58
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90063-M
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#SchrijverS91
2006-05-23
Local constraints ensuring small representing sets.
78-84
1991
58
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90074-Q
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#ErdosHT91
2006-05-23
Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems.
165-180
1991
58
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90058-O
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#AlonBS91
2006-05-23
<i>t</i>-designs.
26-34
1991
58
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90071-N
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#KhosrovshahiA91
2006-05-23
Nimhoff games.
1-25
1991
58
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90070-W
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#FraenkelL91
2006-05-23
Block configurations on real cubic curves.
131-135
1991
58
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90078-U
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#MendelsohnPW91
2006-05-23
Fibres and ordered set coloring.
158-164
1991
58
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90083-S
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#DuffusKT91
2006-05-23
On valences of polyhedra.
279-300
1991
58
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90062-L
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#BarnetteGH91
2006-05-23
The Steiner ratio conjecture for six points.
54-77
1991
58
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90073-P
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#RubinsteinT91
2006-05-23
An infinite class of supplementary difference sets and Williamson matrices.
310-317
1991
58
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90065-O
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#XiaL91
2006-05-23
New modular properties of bell numbers.
147-152
1991
58
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90081-Q
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#Kahale91
2006-05-23
A hyperoctahedral analogue of the free lie algebra.
256-278
1991
58
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90061-K
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#Bergeron91
2006-05-23
<i>q</i>-identity.
318-320
1991
58
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90066-P
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#Yang91
2006-05-23
Partitions of reals: Measurable approach.
136-140
1991
58
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90079-V
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#PlewikV91
2006-05-23
Generalized quadrangles, flocks, and BLT sets.
153-157
1991
58
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90082-R
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta58.html#Kantor91
2006-05-23
Two-colouring all two-element maximal antichains.
109-116
1991
57
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90009-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#DuffusSSW91
2006-05-23
A construction of Hadamard matrices.
86-108
1991
57
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90008-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#Miyamoto91
2006-05-23
Projective equivalence of matroids with coefficients.
15-45
1991
57
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90003-Y
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#Wenzel91
2006-05-23
Duadic codes and difference sets.
254-261
1991
57
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90049-M
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#Rushanan91
2006-05-23
<i>q</i>-separation and binomial products of fibonacci numbers.
306-310
1991
57
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90054-K
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#KonvalinaL91
2006-05-23
Splitting fields of association schemes.
157-161
1991
57
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90014-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#Munemasa91
2006-05-23
On medium-size subgroups and bases of finite groups.
1-14
1991
57
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90002-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#BertramH91
2006-05-23
<i>q</i>-ary and mixed Hamming spaces.
117-129
1991
57
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90010-E
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#Wee91
2006-05-23
Counting complements in the partition lattice, and hypertrees.
144-150
1991
57
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90012-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#Grieser91
2006-05-23
Generalized bounds on binary/ternary mixed packing and covering codes.
130-143
1991
57
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90011-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#LintW91
2006-05-23
<i>r</i><sub>1</sub>= 1.
316-319
1991
57
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90056-M
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#Haemers91
2006-05-23
Spanning sets and scattering sets in Steiner triple systems.
46-59
1991
57
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90004-Z
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#ColbournDS91
2006-05-23
Hecke operators and the weight distributions of certain codes.
163-186
1991
57
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90016-A
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#SchoofV91
2006-05-23
An infinite number of plane figures with Heesch number two.
151-156
1991
57
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90013-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#Fontaine91
2006-05-23
The spectrum for 2-perfect 6-cycle systems.
76-85
1991
57
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90007-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#LindnerPR91
2006-05-23
A result on Dillon's conjecture in difference sets.
238-242
1991
57
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90047-K
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#Davis91
2006-05-23
Difference sets in abelian 2-groups.
262-286
1991
57
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90050-Q
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#Davis91a
2006-05-23
A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems.
302-305
1991
57
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90053-J
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#Teirlinck91
2006-05-23
Additive bases of vector spaces over prime fields.
203-210
1991
57
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90045-I
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#AlonLM91
2006-05-23
Superextensions and the depth of median graphs.
187-202
1991
57
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90044-H
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#BandeltV91
2006-05-23
Maximal arcs and related designs.
294-301
1991
57
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90052-I
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#Trung91
2006-05-23
Simplifications to "A new approach to the covering radius...".
311-315
1991
57
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90055-L
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#Mattson91
2006-05-23
A Ramseyian theorem on products of trees.
68-75
1991
57
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90006-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#McColm91
2006-05-23
Finite flag-transitive semiovals.
60-67
1991
57
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90005-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#Delandtsheer91
2006-05-23
<i>so</i><i>r</i>+ 1, C).
211-237
1991
57
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90046-J
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#BenkartS91
2006-05-23
The polytope of even doubly stochastic matrices.
243-253
1991
57
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90048-L
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#BrualdiL91
2006-05-23
Isomorphism of strong starters in cyclic groups.
287-293
1991
57
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90051-H
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta57.html#PhelpsV91
2006-05-23
A transposition factorization of walk-permutations in graphs.
160-165
1991
56
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90028-F
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#Regev91
2006-05-23
Subdesigns in Steiner quadruple systems.
239-270
1991
56
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90035-F
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#GranvilleH91
2006-05-23
<i>k</i>-homogeneous posets and graphs.
1-15
1991
56
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90018-C
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#DrosteM91
2006-05-23
Upper bounds for football pool problems and mixed covering codes.
84-95
1991
56
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90024-B
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#HamalainenR91
2006-05-23
A note on linear extensions and incomparable pairs.
290-296
1991
56
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90038-I
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#Fishburn91
2006-05-23
Circular codes, loop counting, and zeta-functions.
75-83
1991
56
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90023-A
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#Keller91
2006-05-23
<i>p, q</i>-Stirling numbers and set partition statistics.
27-46
1991
56
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90020-H
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#WachsW91
2006-05-23
Maximal exterior sets of hyperbolic quadrics: The complete classification.
303-308
1991
56
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90040-N
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#Thas91
2006-05-23
Posets with maximal Möbius function.
203-222
1991
56
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90033-D
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#Ziegler91
2006-05-23
<i>S</i><sub><i>n</i></sub>by abelian subgroups and maximal subsets of pairwise noncommuting elements, II.
285-289
1991
56
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90037-H
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#Brown91
2006-05-23
<i>S</i><sub>6</sub><i>v</i>)'s.
16-26
1991
56
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90019-D
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#Milici91
2006-05-23
The embedding of partial triple systems when 4 divides lambda.
109-137
1991
56
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90026-D
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#HiltonR91
2006-05-23
Harmonious groups.
223-238
1991
56
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90034-E
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#BealsGHJ91
2006-05-23
Compressions and isoperimetric inequalities.
47-62
1991
56
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90021-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#BollobasL91
2006-05-23
Homotopy equivalence of posets with a group action.
173-181
1991
56
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90030-K
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#ThevenazW91
2006-05-23
A lower bound on the number of unit distances between the vertices of a convex polygon.
312-316
1991
56
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90042-F
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#EdelsbrunnerH91
2006-05-23
<i>j</i>-Planes.
271-284
1991
56
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90036-G
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#JohnsonPW91
2006-05-23
The partition polynomial of a finite set system.
138-159
1991
56
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90027-E
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#Wagner91
2006-05-23
A double affine plane of order 6.
166-171
1991
56
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90029-G
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#Wertheimer91
2006-05-23
On a conjecture of krammer.
309-311
1991
56
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90041-E
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#Greene91
2006-05-23
Lattice diagrams with few slopes.
96-108
1991
56
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90025-C
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#Czyzowicz91
2006-05-23
A geometric characterization of dowling lattices.
195-202
1991
56
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90032-C
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#BoninB91
2006-05-23
Beyond the Erdös-Ko-Rado theorem.
182-194
1991
56
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90031-B
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#FranklF91
2006-05-23
<i>p</i>-rank of a translation plane.
297-302
1991
56
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(91)90039-J
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#KeyM91
2006-05-23
Isoperimetric inequalities and fractional set systems.
63-74
1991
56
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(91)90022-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta56.html#BollobasL91a
2006-05-23
<i>S</i>-species.
194-203
1990
55
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90067-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#BergeronY90
2006-05-23
Solution of a delta-system decomposition problem.
33-48
1990
55
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90045-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#Lonc90
2006-05-23
<i>n</i>distinct objects?
292-312
1990
55
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90072-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#PittelR90
2006-05-23
<i>Af, Af</i><sup><i>*</i></sup>)-geometries.
133-139
1990
55
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90052-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#Lefevre-Percsy90
2006-05-23
<i>q</i><i>PG</i><i>q</i>) and blocking sets of Redei type.
130-132
1990
55
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90051-W
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#Bruen90
2006-05-23
The extended golay codes considered as ideals.
235-246
1990
55
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90069-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#BernhardtLM90
2006-05-23
<i>k</i>-projections of a point set.
153-160
1990
55
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90055-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#Skiena90
2006-05-23
A new restriction on the lengths of golay complementary sequences.
49-59
1990
55
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90046-Y
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#EliahouKS90
2006-05-23
On the action of the symmetric group on the Free Lie Algebra and the partition lattice.
93-129
1990
55
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90050-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#Barcelo90
2006-05-23
Association schemes on triples and a ternary algebra.
204-234
1990
55
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90068-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#MesnerB90
2006-05-23
<i>n</i>-gon.
316-320
1990
55
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90074-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#Furedi90
2006-05-23
The Orlik-Solomon algebra on the partition lattice and the free Lie algebra.
80-92
1990
55
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90049-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#BarceloB90
2006-05-23
Taxonomic classes of sets.
143-152
1990
55
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90054-Z
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#Lynch90
2006-05-23
Wreath products by the symmetric groups and product posets of Young's lattices.
14-32
1990
55
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90044-W
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#Okada90
2006-05-23
Counting extensions.
247-255
1990
55
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90070-D
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#Spencer90
2006-05-23
<i>n</i>.
256-291
1990
55
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90071-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#HanssensM90
2006-05-23
Translation nets and fixed-point-free group automorphisms.
1-13
1990
55
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90043-V
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#BaileyJ90
2006-05-23
On the geometry of Zara graphs.
74-79
1990
55
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90048-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#Percsy90
2006-05-23
An affine analogue of Wilbrink's theorem.
313-315
1990
55
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90073-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#Pott90
2006-05-23
Some infinite families of finite incidence-polytopes.
60-73
1990
55
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90047-Z
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#Weiss90
2006-05-23
Notes on dimensional closure spaces.
140-142
1990
55
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90053-Y
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#Ohn90
2006-05-23
Robinson-schensted algorithms for skew tableaux.
161-193
1990
55
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90066-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta55.html#SaganS90
2006-05-23
Algebraic relations between matroids connected by weak homomorphisms.
210-224
1990
54
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90031-Q
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#Wenzel90
2006-05-23
Krein conditions and near polygons.
201-209
1990
54
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90030-Z
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#Neumaier90
2006-05-23
Matrix factorizations of determinants and permanents.
132-134
1990
54
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90012-L
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#BrualdiS90
2006-05-23
Product evaluations of lefschetz determinants for grassmannians and of determinants of multinomial coefficients.
235-247
1990
54
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90033-S
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#Proctor90a
2006-05-23
A purely verification proof of the first Rogers-Ramanujan identity.
309-311
1990
54
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90038-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#EkhadT90
2006-05-23
Solution of a sperner conjecture of stanley with a construction of gelfand.
225-234
1990
54
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90032-R
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#Proctor90
2006-05-23
Ulam's searching game with two lies.
1-19
1990
54
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90002-E
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#Guzicki90
2006-05-23
How to communicate efficiently.
312-316
1990
54
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90039-Y
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#Beutelspacher90
2006-05-23
On Golomb's conjecture.
304-308
1990
54
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90037-W
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#Le90
2006-05-23
A very short proof of Dixon's theorem.
141-142
1990
54
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90014-N
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#Ekhad90
2006-05-23
<sup>+</sup>(8, 5) and some non-desarguesian translation planes of order 25.
135-140
1990
54
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90013-M
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#Cooperstein90
2006-05-23
Covering radius and the chromatic number of Kneser graphs.
129-131
1990
54
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90011-K
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#Calderbank90
2006-05-23
Biplanes (56, 11, 2) with involutory collineation fixing 6 points.
149-163
1990
54
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90028-U
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#Marangunic90
2006-05-23
Sub-difference sets of Hadamard difference sets.
112-122
1990
54
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90009-L
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#McFarland90
2006-05-23
On the number of 8×8 latin squares.
143-148
1990
54
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90015-O
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#KolesovaLT90
2006-05-23
<i>n</i><i>n</i>+ 2.
20-40
1990
54
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90003-F
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#LamkenV90
2006-05-23
Iterated combinatorial density theorems.
95-111
1990
54
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90008-K
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#FranklGR90
2006-05-23
<i>q</i><i>q</i>-binomial coefficients.
54-63
1990
54
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90005-H
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#Butler90
2006-05-23
<i>q</i><i>q</i>-Stirling numbers.
64-84
1990
54
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90006-I
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#Leroux90
2006-05-23
An inequality for partially ordered sets.
123-128
1990
54
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90010-T
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#Beck90
2006-05-23
A bijection for ordered factorizations.
317-318
1990
54
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90040-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#GarfieldKW90
2006-05-23
<i>p</i>rank of inclusion matrices.
85-94
1990
54
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90007-J
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#Frankl90
2006-05-23
Character tables of the association schemes of finite orthogonal groups acting on the nonisotropic points.
164-200
1990
54
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90029-V
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#BannaiHS90
2006-05-23
The largest set partitioned by a subfamily of a cover.
296-303
1990
54
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90036-V
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#ComptonM90
2006-05-23
<i>q</i><sup>2</sup><i>q</i>+ 1 sets.
248-271
1990
54
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90034-T
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#Furedi90a
2006-05-23
Unimodality and Young's lattice.
41-53
1990
54
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90004-G
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#Stanton90
2006-05-24
The monomial symmetric functions and the Frobenius map.
272-295
1990
54
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90035-U
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta54.html#EgeciogeluR90
2006-05-23
Two sporadic geometries related to the Hoffman-Singleton graph.
68-80
1990
53
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90020-W
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#Heiss90
2006-05-23
<i>Sp</i><i>n</i>).
209-238
1990
53
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90058-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#Sundaram90
2006-05-23
Reflection processes on graphs and weyl groups.
128-142
1990
53
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90024-Q
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#Mozes90
2006-05-23
Branching flags, branching nets, and reverse matchings.
117-127
1990
53
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90023-P
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#Ueno90
2006-05-23
Unimodality of gaussian coefficients: A constructive proof.
29-52
1990
53
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90018-R
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#OHara90
2006-05-23
<sup>omega</sup>omega.
161-164
1990
53
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90027-T
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#Lawrence90
2006-05-23
Partially strict shifted plane partitions.
143-156
1990
53
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90025-R
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#Okada90a
2006-06-26
Quasi-progressions and descending waves.
81-95
1990
53
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90021-N
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#BrownEF90
2006-05-23
<i>SO</i><i>n</i>+ 1).
239-256
1990
53
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90059-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#Sundaram90a
2006-05-23
A combinatorial construction for products of linear transformations over a finite field.
157-160
1990
53
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90026-S
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#GouldenJ90
2006-05-23
Threshold functions for extension statements.
286-305
1990
53
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90061-Z
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#Spencer90a
2006-05-23
<i>GF</i>(2).
306-315
1990
53
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90062-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#FurediGHK90
2006-05-23
Symmetric functions and P-recursiveness.
257-285
1990
53
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90060-A
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#Gessel90
2006-05-23
Multicolored simon newcomb problems.
53-67
1990
53
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90019-S
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#Rawlings90
2006-05-23
Tiling with polyominoes and combinatorial group theory.
183-208
1990
53
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90057-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#ConwayL90
2006-05-23
The admissibility theorem for the hyperplane transform over a finite field.
316-320
1990
53
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90063-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#Grinberg90
2006-05-23
Constructions for regular polytopes.
1-28
1990
53
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90017-Q
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#McMullenS90
2006-05-23
Descending subsequences of random permutations.
96-116
1990
53
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(90)90022-O
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#Pilpel90
2006-05-23
Gaussian limiting distributions for the number of components in combinatorial structures.
165-182
1990
53
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90056-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#FlajoletS90
2006-05-23
On Cayley's formula for counting forests.
321-323
1990
53
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(90)90064-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta53.html#Takacs90
2006-05-23
On decomposition of hypergraphs into Delta-systems.
158-162
1989
52
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90070-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#Lonc89
2006-05-23
<i>q</i>-Hook length formulas for forests.
165-187
1989
52
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90028-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#BjornerW89
2006-05-23
A conjecture on affine planes of prime order.
44-50
1989
52
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90060-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#Hiramine89
2006-05-23
Recurrences for sums of powers of binomial coefficients.
77-83
1989
52
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90063-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#Cusick89
2006-05-23
Affine difference sets of even order.
188-196
1989
52
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90029-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#ArasuJ89
2006-05-23
The Oberwolfach problem and factors of uniform odd length cycles.
20-43
1989
52
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90059-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#AlspachSSW89
2006-05-23
Minimum number of elements representing a set system of given rank.
84-89
1989
52
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90064-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#Tuza89
2006-05-23
Simple neighbourhoods in triple systems.
10-19
1989
52
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90058-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#Colbourn89
2006-05-23
A new family of relative difference sets.
301-303
1989
52
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90035-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#Jungnickel89
2006-05-23
Extremal problems whose solutions are the blowups of the small witt-designs.
129-147
1989
52
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90067-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#FranklF89
2006-05-23
Some characterizations of type-1 lambda-designs.
288-300
1989
52
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90034-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#Seress89
2006-05-23
A short proof of the restricted Ramsey theorem for finite set systems.
313-320
1989
52
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90037-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#PromelV89
2006-05-23
<i>U</i>(6) and other regular steiner 2-designs.
51-61
1989
52
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90061-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#BagchiB89
2006-05-23
Ulam's searching game with lies.
62-76
1989
52
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90062-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#CzyzowiczMP89
2006-05-23
New upper bounds for the football pool problem for 6, 7, and 8 matches.
304-312
1989
52
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90036-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#LaarhovenALW89
2006-05-23
Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences.
228-274
1989
52
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90032-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#AgarwalSS89
2006-05-23
The exact bound in the Erd$ouml;s-Ko-Rado theorem for cross-intersecting families.
90-97
1989
52
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90065-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#MatsumotoT89
2006-05-23
The probability of generating the symmetric group.
148-153
1989
52
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90068-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#Babai89
2006-05-23
Ascending waves.
275-287
1989
52
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90033-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#AlonS89
2006-05-23
A natural notion of morphism for linear programming problems.
206-227
1989
52
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90031-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#Chavez89
2006-05-23
Some variants of Ferrers diagrams.
98-128
1989
52
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90066-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#Propp89
2006-05-23
Self-orthogonal designs and extremal doubly even codes.
197-205
1989
52
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90030-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#Tonchev89
2006-05-23
<i>PG</i><i>q</i>).
1-9
1989
52
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90057-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#BorosFK89
2006-05-23
Kummer configurations and designs embedded in planes.
154-157
1989
52
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90069-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta52.html#Bruen89
2006-05-23
<i>K</i><sub>1332</sub><i>K</i><sub>6860</sub>.
314-315
1989
51
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90054-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#KobayashiK89
2006-05-23
<i>GF</i><i>p</i><sup><i>m</i></sup>).
104-110
1989
51
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90080-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Moreno89
2006-07-14
On an asymptotic method in enumeration.
77-89
1989
51
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90078-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#MeirM89
2006-05-23
On the generating functions for certain classes of plane partitions.
1-23
1989
51
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90073-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Okada89
2006-05-23
Mappings and symmetries of partitions.
169-180
1989
51
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90043-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Dyson89
2006-05-23
Polyominoes which tile rectangles.
117-124
1989
51
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90082-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Golomb89
2006-05-23
<i>k</i>= 4.
258-267
1989
51
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90051-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#HedayatSL89
2006-05-23
On self-dual, doubly even codes of length 32.
63-76
1989
51
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90077-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Koch89
2006-05-23
Asymptotic behavior of the chromatic index for hypergraphs.
24-42
1989
51
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90074-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#PippengerS89
2006-05-23
Spinor groups and algebraic coding theory.
277-313
1989
51
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90053-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Wood89
2006-05-23
<i>k(n)</i><i>n</i>].
244-249
1989
51
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90049-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#BrownF89
2006-05-23
Generators in cyclic difference sets.
227-236
1989
51
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90047-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Cohen89
2006-05-23
Constructing transpose-orthogonal Latin squares.
221-226
1989
51
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90046-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#McLaurinS89
2006-05-23
Unpredictable strings are collectives.
144-148
1989
51
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90089-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Koppel89
2006-05-23
Detecting errors in searching games.
43-54
1989
51
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90075-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Pelc89
2006-05-23
Pfaff-saalschutz revisited.
141-143
1989
51
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90088-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Zeng89
2006-05-23
<i>Y</i>-hexomino has order 92.
125-126
1989
51
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90083-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Dahlke89
2006-05-23
About prefix sets of words.
237-243
1989
51
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90048-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Bruyere89
2006-05-23
On the maximum number of qualitatively independent partitions.
111-116
1989
51
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90081-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#PoljakT89
2006-05-23
A geometric condition for incidence-matrix nuffvectors.
129-134
1989
51
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90085-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Smith89
2006-05-23
A heptomino of order 76.
127-128
1989
51
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90084-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Dahlke89a
2006-05-23
<i>C</i><sup>infinity</sup>-words of each length.
55-62
1989
51
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90076-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Weakley89
2006-05-23
<sup>+</sup>(10, 3).
250-257
1989
51
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90050-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Shult89
2006-05-23
<i>S</i><sub><i>n</i></sub>.
181-204
1989
51
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90044-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Edelman89
2006-05-23
Which extended goppa codes are cyclic?
205-220
1989
51
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90045-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Stichtenoth89
2006-05-23
Hadamard difference sets in groups of order 64.
138-140
1989
51
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90087-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Gluck89
2006-05-23
<i>k</i>, 1) block designs.
268-276
1989
51
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90052-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#CaminaS89
2006-05-23
Asymptotic enumeration of generalized latin rectangles.
149-160
1989
51
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90041-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Green89
2006-05-23
Anticlusters and intersecting families of subsets.
90-103
1989
51
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90079-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#GriggsW89
2006-05-23
Embedding finite planar spaces into 3-dimensional projective spaces.
161-168
1989
51
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90042-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Metsch89
2006-05-23
Equivalence of the combinatorial and the classical definitions of schur functions.
135-137
1989
51
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90086-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta51.html#Proctor89
2006-05-29
<i>v</i><i>k</i>, lambda) graphs and designs with trivial automorphism group.
33-46
1989
50
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90004-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#BussemakerHSS89
2006-05-26
Arrangements of lines and pseudolines without adjacent triangles.
24-32
1989
50
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90003-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#LjubicRS89
2006-05-26
<i>O</i>-sequences?
319-322
1989
50
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90025-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#Hibi89
2006-05-26
A combinatorial outlook on symmetric functions.
226-234
1989
50
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90016-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#Bergeron89
2006-05-26
Rational generating functions for enumerating chains of partitions.
132-161
1989
50
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90010-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#Butler89
2006-05-26
The relation between burnside rings and combinatorial species.
269-284
1989
50
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90019-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#LabelleY89
2006-05-26
<i>q</i>+ 2 points, blocking sets, and intersecting circles.
308-315
1989
50
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90023-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#BlokhuisB89
2006-05-26
A useful elementary correlation inequality.
305-307
1989
50
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90022-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#BopponaS89
2006-05-26
On arithmetical algorithms over finite fields.
285-300
1989
50
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90020-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#Cantor89
2006-05-26
On the existence of a reasonable upper bound for the van der Waerden numbers.
82-86
1989
50
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90006-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#GreenwellL89
2006-05-26
The Bruhat order and iterated exponentials.
87-99
1989
50
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90007-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#Stembridge89
2006-05-26
Extending generalized quadrangles.
165-171
1989
50
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90012-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#Fisher89
2006-05-26
On the generalized iterates of Yeh's combinatorial K-species.
235-258
1989
50
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90017-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#Labelle89
2006-05-26
Monochromatic sumsets.
162-163
1989
50
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90011-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#ErdosS89
2006-05-26
A combinatorial approach to the character theory of split metabelian groups.
100-109
1989
50
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90008-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#Woldar89
2006-05-26
A counterexample to a conjecture of abbott.
301-304
1989
50
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90021-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#Lemke89
2006-05-26
On mixed insertion, symmetry, and shifted young tableaux.
196-225
1989
50
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90015-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#Haiman89
2006-05-26
Minimal quadrangulations of nonorientable surfaces.
186-195
1989
50
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90014-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#HartsfieldR89
2006-05-26
<i>t</i>-designs with automorphisms.
259-268
1989
50
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90018-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#Kreher89
2006-05-26
Combinatorial aspects of skew representations of the symmetric group.
47-81
1989
50
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90005-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#GarsiaW89
2006-05-26
A note on monoton waves.
316-318
1989
50
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90024-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#Lefmann89
2006-05-26
A logical approach to asymptotic combinatorics II: Monadic second-order properties.
110-131
1989
50
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90009-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#Compton89
2006-06-21
Wire bending.
1-23
1989
50
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(89)90002-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#FranceS89
2006-05-26
Incidence algebra antipodes and lagrange inversion in one and several variables.
172-185
1989
50
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(89)90013-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta50.html#HaimanS89
2006-05-26
Mandatory representation designs.
349-362
1988
49
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90061-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#MendelsohnR88
2006-05-26
Rings of geometries II.
26-66
1988
49
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90027-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#Glynn88
2006-05-26
A note on convex hulls of more-part sperner families.
188-190
1988
49
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90035-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#Sali88
2006-05-26
Blockbusting and domineering.
67-116
1988
49
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90028-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#Berlekamp88
2006-05-26
Some combinatorial problems associated with products of conjugacy classes of the symmetric group.
363-369
1988
49
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90062-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#Jackson88
2006-05-26
A new basis of polytopes.
191-209
1988
49
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90051-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#Kalai88
2006-05-26
Solution of Ulam's problem on binary search with two lies.
384-388
1988
49
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90065-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#CzyzowiczPM88
2006-05-26
Three hundred million points suffice.
210-217
1988
49
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90052-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#Spencer88
2006-05-26
Bijections for partition identities.
13-25
1988
49
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90026-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#OHara88
2006-05-26
<i>S</i><sub>3</sub><i>v</i>).
117-128
1988
49
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90029-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#MiliciQ88
2006-05-26
<i>v</i>congruent to 3 (mod 4).
308-322
1988
49
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90058-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#MillsM88
2006-05-26
<i>PG</i><i>n</i><i>q</i><i>n</i><i>q</i>geq 2.
338-348
1988
49
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90060-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#Batten88
2006-05-26
<i>q</i><i>GF</i><i>q</i><i>q</i>.
172-174
1988
49
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90032-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#Dur88
2006-05-26
Factorizations of symmetric designs.
323-337
1988
49
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90059-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#CaenG88
2006-06-07
<i>K</i><sub><i>n</i></sub>into cycles of odd length.
218-232
1988
49
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90053-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#HeinrichLR88
2006-05-26
No extendable biplane of order nine.
1-12
1988
49
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90025-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#Bagchi88
2006-05-26
A simple way to tell a simple polytope from its graph.
381-383
1988
49
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90064-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#Kalai88a
2006-05-26
<i>S</i><sub><i>n</i></sub>by abelian subgroups and maximal subsets of pairwise noncommuting elements.
294-307
1988
49
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90057-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#Brown88
2006-05-26
Numerical invariants of strongly regular graphs.
145-171
1988
49
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90031-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#BierC88
2006-05-29
On induced subgraphs of the cube.
180-187
1988
49
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90034-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#ChungFGS88
2006-05-26
Hermitian congruence and the existence and completion of generalized Hadamard matrices.
233-261
1988
49
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90054-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#Brock88
2006-05-26
On the 2-adjugate mod 2 class of designs.
392-394
1988
49
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90067-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#Sinha88
2006-05-26
The asymptotic number of rooted nonseparable maps on a surface.
370-380
1988
49
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90063-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#BenderW88
2006-05-26
On the diameter of cayley graphs of the symmetric group.
175-179
1988
49
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90033-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#BabaiS88
2006-05-26
A simplified construction of nonlinear Davenport-Schinzel sequences.
262-267
1988
49
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90055-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#Komjath88
2006-05-26
The number of unrelated partitions.
389-391
1988
49
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90066-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#Bollobas88
2006-05-26
Finite linear spaces with flag-transitive groups.
268-293
1988
49
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90056-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#BuekenhoutDD88
2006-05-26
Epidemiography II. Games with a dozing yet winning player.
129-144
1988
49
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90030-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta49.html#FraenkelLN88
2006-05-26
Groups which produce generalized quadrangles.
139-145
1988
48
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90081-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#Frohardt88
2006-05-26
Inequalities for quasi-symmetric designs.
53-64
1988
48
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90074-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#Calderbank88
2006-05-26
<i>SL</i><i>SL</i>(2, 5).
189-196
1988
48
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90005-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#Hiramine88
2006-05-26
Another look at Bruen chains.
77-90
1988
48
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90076-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#BakerEW88
2006-05-26
Tilings in Z with triples.
229-235
1988
48
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90008-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#Meyerowitz88
2006-05-26
On the impossibility of packing space with different cubes.
174-188
1988
48
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90004-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#Dawson88
2006-05-26
<i>Z</i><sub>2</sub><i>Z</i><sub>2</sub>fixing some point.
239-246
1988
48
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90010-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#CepulicE88
2006-05-26
On finite locally projective planar spaces.
247-254
1988
48
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90011-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#Kern88
2006-05-26
<i>s</i><i>s</i>+ 2).
1-11
1988
48
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90070-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#SoeteT88
2006-05-26
Generating functions for column-convex polyominoes.
12-31
1988
48
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90071-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#Delest88
2006-05-26
Projective embedding of certain linear spaces.
266-269
1988
48
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90014-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#Frank88
2006-05-26
Flag algebras of a symmetric design.
209-228
1988
48
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90007-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#Smith88
2006-05-26
The asymptotic number of tree-rooted maps on a surface.
156-164
1988
48
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90002-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#BenderCR88
2006-05-26
An impediment to polyhedrality.
259-265
1988
48
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90013-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#Barnette88
2006-05-26
<i>N</i>.
39-52
1988
48
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90073-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#BergelsonH88a
2006-05-26
<i>P, I</i>) transitivity.
136-138
1988
48
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90080-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#Czerwinski88
2006-05-26
Projective extensions of Kirkman systems as substructures of projective planes.
197-208
1988
48
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90006-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#DrakeH88
2006-05-26
First distribution invariants and EKR theorems.
91-103
1988
48
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90077-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#ManickamS88
2006-05-26
Density versions of two generalizations of Schur's theorem.
32-38
1988
48
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90072-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#BergelsonH88
2006-05-26
Edges in the poset of partitions of an integer.
236-238
1988
48
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90009-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#Robinson88
2006-05-26
A chain decomposition theorem.
65-76
1988
48
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90075-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#Todorcevic88
2006-05-26
<i>d</i><i>a</i><i>a</i>".
120-135
1988
48
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90079-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#AgarwalM88
2006-05-26
Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs.
147-155
1988
48
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90001-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#Zaks88
2006-05-26
On minimum weight codewords in QR codes.
104-119
1988
48
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90078-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#Newhart88
2006-05-26
Prefix search with a lie.
165-173
1988
48
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90003-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#Pelc88
2006-05-26
Multiset antichains having minimal downsets.
255-258
1988
48
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90012-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta48.html#Clements88
2006-05-26
Geometric invariants for quasi-symmetric designs.
101-110
1988
47
J. Comb. Theory, Ser. A
1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#Calderbank88a
2006-05-26
Maximum permanents of matrices of zeros and ones.
207-245
1988
47
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90019-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#BrualdiGM88
2006-05-26
On subspaces spanned by random selections of plus/minus 1 vectors.
124-133
1988
47
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90046-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#Odlyzko88
2006-05-26
On existence and number of orthogonal arrays.
28-36
1988
47
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90041-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#Ray-ChaudhuriS88
2006-05-26
The hyperbolic lines of finite symplectic spaces.
284-298
1988
47
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90022-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#Hall88
2006-05-26
Greedy packing and series-parallel graphs.
6-15
1988
47
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90039-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#HoffmanT88
2006-05-26
Herbert J. Ryser 1923-1985.
1-5
1988
47
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90038-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#X88
2006-05-26
<i>x</i><i>y</i>)-theorem to a problem in statistics.
150-152
1988
47
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90049-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#Bridges88
2006-05-26
Hyperplane skew resolutions and their applications.
134-144
1988
47
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90047-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#Fuji-HaraV88
2006-05-26
Jack symmetric functions and some combinatorial properties of young symmetrizers.
37-70
1988
47
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90042-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#Hanlon88
2006-05-26
On designs (22, 33, 12, 8, 4).
157-175
1988
47
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90016-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#HallRRV88
2006-05-26
A directed graph version of strongly regular graphs.
71-100
1988
47
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90043-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#Duval88
2006-05-26
Saturated chains of subsets and a random walk.
262-283
1988
47
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90021-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#Griggs88
2006-05-26
A family of symmetric block designs.
153-156
1988
47
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90050-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#Whiteman88
2006-09-18
A forbidden configuration theorem of Alon.
16-27
1988
47
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90040-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#Anstee88
2006-05-26
Posets of shuffles.
191-206
1988
47
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90018-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#Greene88
2006-05-26
Certain distance-regular digraphs and related rings of characteristic 4.
111-123
1988
47
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90045-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#LieblerM88
2006-05-26
Binary vectors with prescribed subsets of consecutive ones.
176-190
1988
47
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90017-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#Apostol88
2006-05-26
Quantitative theorems for regular systems of equations.
246-261
1988
47
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(88)90020-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#FranklGR88
2006-05-26
Counting modular matrices with specified euclidean norm.
145-149
1988
47
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(88)90048-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta47.html#Newman88
2006-05-26
Erdös-Ko-Rado theorem with conditions on the maximal degree.
252-263
1987
46
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90005-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta46.html#Frankl87
2006-05-26
On the combinatorics of plethysm.
212-251
1987
46
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90004-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta46.html#Nava87
2006-05-26
<i>gl</i><sub><i>n</i></sub>.
79-120
1987
46
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90077-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta46.html#Stembridge87
2006-05-26
<i>k</i>-welter - a generalization of Welter's game.
1-20
1987
46
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90073-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta46.html#KahaneF87
2006-05-29
Some new conjugate orthogonal Latin squares.
314-318
1987
46
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90009-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta46.html#BennettWZ87
2006-05-26
Nonsingular plane cubic curves over finite fields.
183-211
1987
46
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90003-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta46.html#Schoof87
2006-05-26
Antipodes and incidence coalgebras.
264-290
1987
46
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90006-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta46.html#Schmitt87
2006-05-26
Une combinatoire du pléthysme.
291-305
1987
46
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90007-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta46.html#Bergeron87
2006-05-26
Generalized handcuffed designs.
175-182
1987
46
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90002-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta46.html#Maurin87
2006-05-26
On the universal sequence generated by a class of unimodal functions.
39-49
1987
46
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90075-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta46.html#WangK87
2006-05-26
On twofold triple systems and their automorphism groups.
306-313
1987
46
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90008-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta46.html#Clayton87
2006-05-26
PSPACE-hardness of some combinatorial games.
21-38
1987
46
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90074-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta46.html#FraenkelG87
2006-05-26
<i>D</i><i>N</i>equiv 2 mod 4.
156-158
1987
46
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90079-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta46.html#Kharaghani87
2006-05-26
Almost cyclic polytopes.
159-174
1987
46
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90001-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta46.html#Shemer87
2006-05-26
Heawood inequalities.
50-78
1987
46
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90076-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta46.html#Sarkaria87
2006-05-26
Permutation representations arising from simplicial complexes.
121-155
1987
46
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90078-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta46.html#Thevenaz87
2006-05-26
On subsets of abelian groups with no 3-term arithmetic progression.
157-161
1987
45
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90053-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#FranklGR87
2006-05-26
Exact coverings of 2-paths by 4-cycles.
50-61
1987
45
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90046-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#HeinrichN87
2006-05-26
Parallelepipeds in sets of integers.
163-170
1987
45
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90011-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#Berend87
2006-05-26
<i>N</i><i>N</i>".
40-49
1987
45
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90045-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#AgarwalA87
2006-05-26
<i>(m, p, c)</i>-sets.
300-302
1987
45
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90020-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#DeuberH87
2006-05-26
The enumeration of certain sets of block maps.
263-276
1987
45
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90017-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#Rhodes87
2006-06-22
Ramsey-type results for metric spaces.
323-328
1987
45
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90025-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#Komjath87
2006-05-26
<i>P-</i><i>Q</i>-polynomial association schemes.
8-26
1987
45
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90042-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#Terwilliger87
2006-05-26
A combinatorial proof of the multivariable lagrange inversion formula.
178-195
1987
45
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90013-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#Gessel87
2006-05-26
<i>k</i>-transversals.
1-7
1987
45
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90041-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#AharoniK87
2006-05-26
Uniformly resolvable pairwise balanced designs with blocksizes two and three.
207-225
1987
45
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90015-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#Rees87
2006-05-26
<i>Q</i>-functions, and a conjecture of R. Stanley.
62-103
1987
45
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90047-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#Sagan87
2006-05-26
An extension of a congruence by Andrews for generalized frobenius partitions.
31-39
1987
45
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90044-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#Kolitsch87
2006-05-26
The existence of room 5-cubes.
125-138
1987
45
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90049-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#Dinitz87
2006-05-26
On the degree of transitivity of permutation groups: A short proof.
310-315
1987
45
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90023-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#BabaiS87
2006-05-26
<i>PG</i>(2, 9).
303-305
1987
45
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90021-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#Resmini87
2006-05-26
The weakly neighborly polyhedral maps on the non-orientable 2-manifold with Euler characteristic -2.
104-124
1987
45
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90048-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#AltshulerB87
2006-05-26
Characterizing the line set of a baer subspace.
152-156
1987
45
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90052-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#BeutelspacherS87
2006-05-26
Exact solution of some Turán-type problems.
226-262
1987
45
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90016-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#FranklF87
2006-05-26
Sorting by insertion of leading elements.
306-309
1987
45
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90022-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#AignerW87
2006-05-26
<i>k</i><i>n</i><i>n</i>matrices over a finite field will be zero.
290-299
1987
45
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90019-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#Kovacs87
2006-05-26
Even permutations as a product of two elements of order five.
196-206
1987
45
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90014-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#BrennerE87
2006-05-26
A helly type theorem for hypersurfaces.
27-30
1987
45
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90043-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#DezaF87
2006-05-26
<i>AG</i><i>n</i><i>q</i>).
139-147
1987
45
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90050-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#Fuji-HaraV87
2006-05-26
Decomposition of infinite matrices.
277-289
1987
45
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90018-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#Dougherty87
2006-05-26
On the planes of narayana rao and satyanarayana.
148-151
1987
45
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90051-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#Barriga87
2006-05-26
The football pool problem for 6 matches: A new upper bound obtained by simulated annealing.
171-177
1987
45
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90012-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#Wille87
2006-05-26
<i>P</i><i>n</i><i>P</i><sub><i>m</i></sub><i>n</i>).
316-322
1987
45
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90024-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta45.html#Maruyama87
2006-05-26
On weights in duadic codes.
6-21
1987
44
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90056-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#PlessML87
2006-05-26
<i>f</i>-vectors of 4-polytopes.
141-151
1987
44
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90066-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#Bayer87
2006-05-26
Counting unlabeled structures.
83-93
1987
44
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90061-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#Promel87
2006-05-26
Orbits on points and lines in finite linear and quasilinear spaces.
159-163
1987
44
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90069-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#BlokhuisBDD87
2006-05-26
Four pairwise orthogonal latin squares of order 24.
152-155
1987
44
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90067-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#RouthP87
2006-05-26
On finite division algebras.
253-266
1987
44
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90032-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#Glynn87a
2006-07-11
Every finite distributive lattice is a set of stable matchings for a small stable marriage instance.
304-309
1987
44
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90037-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#GusfieldILS87
2006-05-26
New infinite families of simple 5-designs.
1-5
1987
44
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90055-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#MagliverasP87
2006-05-26
The Radon transform on Abelian Groups.
168-171
1987
44
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90071-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#FranklG87
2006-05-26
A note on Bailey's Lemma.
164-167
1987
44
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90070-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#Paule87
2006-05-26
Rings of geometries I.
34-48
1987
44
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90058-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#Glynn87
2006-05-26
More on maximal intersecting families of finite sets.
299-303
1987
44
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90036-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#Blokhuis87
2006-05-26
Self-dual sequences.
288-298
1987
44
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90035-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#Etzion87
2006-05-26
The automorphism groups of Reed-Solomon codes.
69-82
1987
44
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90060-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#Dur87
2006-05-26
Embedding partial triple systems.
241-252
1987
44
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90031-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#RodgerS87
2006-05-26
Chains, antichains, and fibres.
207-228
1987
44
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90029-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#LoncR87
2006-05-26
<i>C</i><sub>3</sub>geometries.
173-181
1987
44
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90027-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#Rees87a
2006-05-29
Coverings of Pairs by Quintuples.
49-68
1987
44
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90059-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#LamkenMMV87
2006-05-26
Hadamard matrices and doubly even self-dual error-correcting codes.
274-287
1987
44
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90034-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#Ozeki87
2006-05-26
Minimal linear spaces.
229-240
1987
44
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90030-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#JungnickelL87
2006-05-26
The existence of resolvable Steiner quadruple systems.
182-206
1987
44
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90028-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#Hartman87
2006-05-26
Induced restricted Ramsey theorems for spaces.
120-128
1987
44
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90064-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#FranklGR87a
2006-05-26
Solution of Ulam's problem on searching with a lie.
129-140
1987
44
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90065-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#Pelc87
2006-05-26
The application of invariant theory to the existence of quasi-symmetric designs.
94-109
1987
44
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90062-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#Calderbank87
2006-05-26
<i>q</i>-Catalan numbers and hypergeometric series.
267-273
1987
44
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(87)90033-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#Andrews87
2006-05-29
The boundary characteristic and Pick's theorem in the Archimedean planar tilings.
110-119
1987
44
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90063-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#RenR87
2006-05-26
An infinitary version of the Graham-Leeb-Rothschild theorem.
22-33
1987
44
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90057-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#Carlson87
2006-05-26
On Wilbrink's Theorem.
156-158
1987
44
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(87)90068-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta44.html#Arasu87
2006-05-26
An infinite version of Ryser's inequality.
329-330
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90071-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Komjath86
2006-05-26
<i>F</i>-rectangles, orthogonal arrays, and codes.
149-164
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90057-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#FedererM86
2006-05-26
Symmetries of plane partitions.
103-113
1986
43
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90028-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Stanley86
2006-05-26
A schensted-type correspondence for the symplectic group.
320-328
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90070-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Berele86
2006-05-26
The asymptotic number of rooted maps on a surface.
244-257
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90065-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#BenderC86
2006-05-26
Generalized Euler and Chu-Vandermonde identities.
52-57
1986
43
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90022-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Yang86
2006-05-26
<i>S</i><sub>3</sub><i>v</i>).
334-337
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90073-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#JungnickelV86
2006-05-26
Hadamard matrices of order 28 with automorphism groups of order two.
98-102
1986
43
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90027-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Kimura86
2006-05-26
Cyclic projective planes and binary, extended cyclic self-dual codes.
331-333
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90072-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Pless86a
2006-05-26
The existence of simple 6-(14, 7, 4) designs.
237-243
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90064-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#KreherR86
2006-05-26
Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory.
91-97
1986
43
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90026-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#AlonB86
2006-05-26
<i>Q</i>-codes.
258-276
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90066-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Pless86
2006-05-26
<i>k</i>-rootsystems.
114-129
1986
43
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90029-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Hailat86
2006-05-26
A density statement generalizing Schur's theorem.
338-343
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90074-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Bergelson86
2006-05-26
Shuffle of parenthesis systems and baxter permutations.
1-22
1986
43
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90018-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#CoriDV86
2006-05-26
On orthogonal latin squares.
146-148
1986
43
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90034-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Woodcock86
2006-05-26
On a natural extension of Jacob's ranks.
205-218
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90061-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#JustinP86
2006-05-26
The Erdös-Ko-Rado theorem for vector spaces.
228-236
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90063-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#FranklW86
2006-05-26
The number of extreme pairs of finite point-sets in Euclidean spaces.
344-349
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90075-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#EdelsbrunnerS86
2006-05-26
Note on decomposition of spheres in Hilbert spaces.
38-44
1986
43
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90020-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#PreissR86
2006-05-26
All maximum 2-part Sperner families.
58-69
1986
43
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90023-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#ErdosK86
2006-05-26
Shanks' convergence acceleration transform, Padé approximants and partitions.
70-84
1986
43
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90024-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#AndrewsGJ86
2006-05-26
Every finite group is the automorphism group of some perfect code.
45-51
1986
43
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90021-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Phelps86
2006-05-26
(81, 16, 3) Abelian difference sets do not exist.
350-353
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90076-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Arasu86
2006-05-26
The number of subsets without a fixed circular distance.
130-132
1986
43
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90030-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Moser86
2006-05-26
<i>p</i>-rang von inzidenzmatrizen.
138-139
1986
43
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90032-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Klemm86
2006-05-26
Asymptotic analogs of the Rogers-Ramanujan identities.
303-319
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90069-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Brenner86
2006-05-26
Combinatorial properties of planar spaces and embeddability.
291-302
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90068-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Teirlinck86
2006-05-26
New results for quasi-symmetric designs - An application of MACSYMA.
277-290
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90067-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#MeyerowitzSS86
2006-05-26
The generalized Sprague-Grundy function and its invariance under certain mappings.
165-177
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90058-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#FraenkelY86
2006-05-26
<i>S</i>(5, 8, 24).
219-227
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90062-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Tonchev86
2006-05-29
Some intersection theorems for ordered sets and graphs.
23-37
1986
43
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90019-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#ChungGFS86
2006-05-26
Partition relations for countable topological spaces.
178-195
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90059-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Baumgartner86
2006-05-26
Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas.
196-204
1986
43
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90060-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#AharoniL86
2006-05-26
<i>k lt v/2</i>.
133-137
1986
43
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90031-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Trung86
2006-05-26
<i>v</i><i>k</i>, 1) designs.
140-145
1986
43
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90033-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#DelandsheerST86
2006-05-26
A new generalization of the Erdös-Ko-Rado theorem.
85-90
1986
43
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90025-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta43.html#Pyber86
2006-05-26
Quasi-symmetric 2-(31, 7, 7) designs and a revision of Hamada's conjecture.
104-110
1986
42
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90009-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Tonchev86a
2006-05-26
Extraneous multipliers of cyclic difference sets.
259-269
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90096-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Wu86
2006-05-26
Finiteness questions in quasi-symmetric designs.
252-258
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90095-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#SaneS86
2006-05-26
All rationals occur as exponents.
200-206
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90090-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Frankl86
2006-05-26
An elementary proof of the canonizing version of Gallai-Witt's theorem.
144-149
1986
42
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90014-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#PromelR86
2006-05-26
<i>q</i>-analogues.
15-30
1986
42
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90004-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#EgeciogluR86
2006-05-26
A dual form of Erdös-Rado's canonization theorem.
159-178
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90087-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#PromelSV86
2006-05-26
Addendum to the paper "On the dependence of functions on their variables".
317
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90105-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#EhrenfeuchtKMM86
2006-05-26
A new biplane of order 9 with a small automorphism group.
305-309
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90103-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#JankoT86
2006-05-26
Preassigning the shape of projections of convex polytopes.
293-295
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90099-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Barnette86
2006-05-26
<i>t</i>-designs with automorphisms.
239-251
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90094-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Kreher86
2006-05-26
<i>k</i>-Color Sperner theorems.
31-54
1986
42
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90005-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#GriggsOS86
2006-05-26
The nonexistence of code words of weight 16 in a projective plane of order 10.
207-214
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90091-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#LamTS86
2006-05-26
Minimum dimension embedding of finite metric spaces.
184-199
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90089-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Witsenhausen86
2006-05-26
Notes on the derived walker planes.
320-323
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90107-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#JhaJ86
2006-05-26
Two selection problems revisited.
310-316
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90104-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#KirschenhoferP86
2006-05-26
A sublattice of the Leech lattice.
9-14
1986
42
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90003-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#MillerW86
2006-05-26
On the poset of partitions of an integer.
215-222
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90092-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Ziegler86
2006-05-26
Self-complementary totally symmetric plane partitions.
277-292
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90098-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#MillsRR86
2006-05-26
Remarks on symbols, hooks and degrees of unipotent characters.
223-238
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90093-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Olsson86
2006-05-26
<i>t</i><i>k</i>= 6.
55-60
1986
42
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90006-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#AssmusK86
2006-05-26
Inherited arcs in finite affine planes.
140-143
1986
42
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90013-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Korchmaros86
2006-05-26
Nonexistence of weakly neighborly polyhedral maps on the orientable 2-manifold of genus 2.
87-103
1986
42
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90008-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#AltshulerB86
2006-05-26
Reconstructing the ternary Golay code.
296-299
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90100-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Goldberg86
2006-05-26
A new approach to the covering radius of codes.
61-86
1986
42
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90007-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Sloane86
2006-05-26
Embedding geometric lattices with topology.
126-136
1986
42
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90011-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Groh86a
2006-05-26
On the diagonal queens domination problem.
137-139
1986
42
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90012-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#CockayneH86
2006-05-26
Geometric lattices with topology.
111-125
1986
42
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90010-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Groh86
2006-05-26
<i>n</i><i>n</i>.
1-8
1986
42
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90002-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Abatangelo86
2006-05-26
A note on the cake-division problem.
300-301
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90101-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Woodall86
2006-05-26
Product constructions for cyclic block designs II. Steiner 2-designs.
179-183
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90088-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#GrannellG86
2006-05-26
Lower bounds for small diagonal ramsey numbers.
302-304
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90102-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Shearer86
2006-05-26
<i>x, y</i>)-transitive generalized quadrangles.
154-157
1986
42
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90016-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Thas86
2006-05-26
<i>k</i>-gon result.
318-319
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90106-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#Johnson86
2006-05-26
Disjoint covering systems of rational beatty sequences.
150-153
1986
42
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90015-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#BergerFF86
2006-05-26
Large minimal sets which force long arithmetic progressions.
270-276
1986
42
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90097-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta42.html#GrahamN86
2006-05-26
A canonical version for partition regular systems of linear equations.
95-104
1986
41
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90117-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#Lefmann86
2006-05-26
Answers to two questions about semi-symmetric designs.
276-277
1986
41
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90084-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#JankoT86a
2006-05-26
A generalisation of Canfield's formula.
50-60
1986
41
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90114-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#BenderR86
2006-05-26
<sup><i>d</i></sup>part II: Sufficiency of Eckhoff's conditions.
167-188
1986
41
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90079-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#Kalai86
2006-05-26
Characterization of projective planes of small prime orders.
189-220
1986
41
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90080-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#Ho86
2006-05-26
A method for constructing generalised residual designs.
11-20
1986
41
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90111-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#Lloyd86
2006-05-26
Q-counting rook configurations and a formula of frobenius.
246-275
1986
41
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90083-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#GarsiaR86
2006-05-26
The extension to root systems of a theorem on tournaments.
228-245
1986
41
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90082-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#CalderbankH86
2006-05-26
Non-trivial intersecting families.
150-153
1986
41
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90121-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#FranklF86
2006-05-26
The number of small semispaces of a finite set of points in the plane.
154-157
1986
41
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90122-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#AlonG86
2006-05-26
Decomposition of the complete hypergraph into delta-systems II.
139-149
1986
41
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90120-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#MouyartS86
2006-05-26
On the minimum rank of regular classes of matrices of zeros and ones.
32-49
1986
41
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90113-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#BrualdiMR86
2006-05-26
On the maximal number of edges of many faces in an arrangement.
159-166
1986
41
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90078-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#EdelsbrunnerW86
2006-05-26
Path generating functions and continued fractions.
1-10
1986
41
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90110-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#GouldenJ86
2006-05-26
On growing a random young tableau.
278-285
1986
41
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90085-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#Pittel86
2006-05-26
On the cuts and cut number of the 4-cube.
221-227
1986
41
J. Comb. Theory, Ser. A
2
http://dx.doi.org/10.1016/0097-3165(86)90081-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#Emamy-Khansary86
2006-05-26
Distributions, continued fractions, and the Ehrenfest Urn model.
21-31
1986
41
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90112-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#GouldenJ86a
2006-05-26
Covering triples by quadruples: An asymptotic solution.
117-138
1986
41
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90119-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#HartmanMM86
2006-05-26
The number of repeated blocks in twofold triple systems.
61-88
1986
41
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90115-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#RosaH86
2006-05-26
An improved lower bound on the greatest element of a sum-distinct set of fixed order.
89-94
1986
41
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90116-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#Elkies86
2006-05-26
"Poly-unsaturated" posets: The Greene-Kleitman theorem is best possible.
105-116
1986
41
J. Comb. Theory, Ser. A
1
http://dx.doi.org/10.1016/0097-3165(86)90118-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jcta41.html#West86
2006-06-20
String graphs requiring exponential representations.
1-4
1991
53
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90050-T
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#KratochvilM91
2006-06-20
Two classes of perfect graphs.
273-292
1991
53
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90078-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#Sun91
2006-06-20
A characterisation of graphs having three pairwise compatible Euler tours.
80-92
1991
53
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90054-N
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#Jackson91
2006-06-20
<i>n</i>-chromatic absolute retracts.
5-31
1991
53
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90051-K
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#BandeltP91
2006-06-20
Clumps, minimal asymmetric graphs, and involutions.
40-79
1991
53
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90053-M
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#Sabidussi91
2006-06-20
The number of rooted 2-connected triangular maps on the projective plane.
130-142
1991
53
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90058-R
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#Gao91
2006-06-20
A weighted min-max relation for intervals.
151-172
1991
53
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90073-S
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#Lubiw91
2006-06-20
Multicolored forests in bipartite decompositions of graphs.
143-148
1991
53
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90059-S
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#AlonBS91a
2006-06-20
<i>Y</i><i>H</i>-graphs.
114-129
1991
53
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90057-Q
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#HortonB91
2006-06-20
On a composition of independence systems by circuit identification.
235-259
1991
53
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90076-V
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#EulerM91
2006-06-20
Supplementary Eulerian vectors in isotropic systems.
93-105
1991
53
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90055-O
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#Jackson91a
2006-06-20
The number of rooted maps on an orientable surface.
293-299
1991
53
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90079-Y
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#BenderC91
2006-06-20
Hamiltonicity in claw-free graphs.
173-194
1991
53
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90074-T
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#Shepherd91
2006-07-03
<i>n</i>-fach zusammenhängenden Digraphen.
260-272
1991
53
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90077-W
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#Mader91
2006-06-20
A note on the independence number of triangle-free graphs, II.
300-307
1991
53
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90080-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#Shearer91
2006-06-20
On the two-dimensional generic rigidity matroid and its dual.
106-113
1991
53
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90056-P
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#Servatius91
2006-06-20
Short proofs on multicommodity flows and cuts.
32-39
1991
53
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90052-L
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#Schrijver91
2006-06-20
Multiply-intersecting families.
195-234
1991
53
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90075-U
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb53.html#Frankl91
2006-06-20
The number of rooted triangular maps on a surface.
236-249
1991
52
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90065-R
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#Gao91a
2006-06-20
The Hamiltonian property of generalized de Bruijn digraphs.
1-8
1991
52
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90084-W
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#DuHHZ91
2006-06-20
The total chromatic number of nearly complete bipartite graphs.
9-19
1991
52
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90085-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#Hilton91
2006-06-20
On multipartite tournaments.
284-300
1991
52
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90069-V
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#GoddardKOT91
2006-06-20
Graph minors. X. Obstructions to tree-decomposition.
153-190
1991
52
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90061-N
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#RobertsonS91
2006-06-20
<i>C</i><sup>4</sup><i>C</i><sup>6</sup><i>C</i><sup>10</sup>'s.
113-116
1991
52
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90097-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#Wenger91
2006-06-20
Some extremal connectivity results for matroids.
301-320
1991
52
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90070-Z
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#AkkariO91
2006-06-20
A ramsey type problem concerning vertex colourings.
45-52
1991
52
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90089-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#BrownR91
2006-06-20
Infinite friendship graphs with infinite parameters.
30-41
1991
52
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90087-Z
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#HahnMW91
2006-06-20
String graphs. I. The number of critical nonstring graphs is infinite.
53-66
1991
52
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90090-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#Kratochvil91
2006-06-20
Quickly excluding a forest.
274-283
1991
52
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90068-U
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#BienstockRST91
2006-06-20
Constructing self-dual codes using graphs.
250-258
1991
52
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90066-S
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#Oral91
2006-06-20
String graphs. II. recognizing string graphs is NP-hard.
67-78
1991
52
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90091-W
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#Kratochvil91a
2006-06-20
Even subgraph expansions for the flow polynomial of cubic plane maps.
259-273
1991
52
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90067-T
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#Jaeger91
2006-06-20
A new proof of the theorem by Fleischner.
117-123
1991
52
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90098-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#Riha91
2006-06-20
Extensions of Gallai's graph covering theorems for uniform hypergraphs.
92-96
1991
52
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90094-Z
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#Tuza91
2006-09-29
<i>k</i>-connected graphs.
20-29
1991
52
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90086-Y
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#EgawaGL91
2006-06-20
Characterization of the maximum genus of a signed graph.
124-146
1991
52
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90099-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#SiranS91
2006-06-20
An interpolation theorem for partitions which are indivisible with respect to cohereditary properties.
97-101
1991
52
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90095-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#Ivanco91
2006-06-20
On graphs with exactly one eigenvalue less than -1.
102-112
1991
52
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90096-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#Petrovic91
2006-06-20
Properties of graphs with polynomial growth.
222-235
1991
52
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90064-Q
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#Seifter91
2006-06-22
A counterexample to the conjecture of Aksionov and Mel'nikov on non-3-colorable planar graphs.
218-219
1984
36
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(84)90027-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#Ma84
2006-06-20
On the thickness and arboricity of a graph.
147-151
1991
52
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90100-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#DeanHS91
2006-06-20
Permutation-partition pairs. III. Embedding distributions of linear families of graphs.
191-218
1991
52
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90062-O
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#Stahl91
2006-06-20
Hypergraph coverings and local colorings.
79-85
1991
52
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90092-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#CaroT91
2006-06-20
On a generalization of a theorem of Nash-Williams.
42-44
1991
52
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90088-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#Fassbender91
2006-06-20
An upper bound for the average number of regions.
219-221
1991
52
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90063-P
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#Stahl91a
2006-06-20
The menger-like property of the tree-width of infinite graphs.
86-91
1991
52
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90093-Y
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb52.html#KrizT91
2006-06-21
Vertex coverings by monochromatic cycles and trees.
90-95
1991
51
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90007-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#ErdosGP91
2006-06-20
Clique graphs and Helly graphs.
34-45
1991
51
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90004-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#BandeltP91a
2006-06-20
<i>K</i>-Elimination property for circuits of matroids.
211-226
1991
51
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90037-K
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#Lemos91
2006-06-20
<i>P</i><i>Q</i>-polynomial association schemes.
314-328
1991
51
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90045-L
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#Munemasa91a
2006-06-20
Biased graphs. II. The three matroids.
46-72
1991
51
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90005-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#Zaslavsky91
2006-06-20
Disjoint circuits of prescribed homotopies in a graph on a compact surface.
127-159
1991
51
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90009-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#Schrijver91a
2006-06-20
Edge-disjoint in- and out-branchings in tournaments and related path problems.
1-23
1991
51
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90002-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#Bang-Jensen91
2006-06-20
Generating projective plane polyhedral maps.
277-291
1991
51
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90043-J
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#Barnette91
2006-06-20
On the diameter of the edge cover polytope.
271-276
1991
51
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90042-I
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#Hurkens91
2006-06-20
Short-chorded and perfect graphs.
24-33
1991
51
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90003-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#Lubiw91a
2006-06-20
Decomposition of graphs on surfaces and a homotopic circulation theorem.
161-210
1991
51
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90036-J
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#Schrijver91b
2006-06-20
On the classification of plane graphs representing structurally stable rational Newton flows.
256-270
1991
51
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90041-H
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#JongenJT91
2006-06-20
Extending cycles in bipartite graphs.
292-313
1991
51
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90044-K
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#Hendry91
2006-06-20
Non-symmetric, metric, cometric association schemes are self-dual.
244-247
1991
51
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90039-M
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#Leonard91
2006-06-20
Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices.
73-89
1991
51
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90006-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#GregoryPJL91
2006-06-20
A mengerian theorem for infinite graphs with ideal points.
248-255
1991
51
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90040-Q
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#Polat91
2006-06-20
Broken circuit complexes: Factorizations and generalizations.
96-126
1991
51
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(91)90008-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#BjornerZ91
2006-06-20
Topological aspects of edge fusions in 4-graphs.
227-243
1991
51
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(91)90038-L
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb51.html#FerriL91
2006-06-20
Sur un nouvel invariant des graphes et un critère de planarité.
11-21
1990
50
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90093-F
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Verdiere90
2006-06-20
The incidence structure of subspaces with well-scaled frames.
265-287
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90082-B
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Lee90
2006-06-20
Cycles and paths of many lengths in bipartite digraphs.
254-264
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90081-A
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#AmarM90
2006-06-20
On the inversion of the sign of one basis in an oriented matroid.
299-308
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90084-D
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#BieniaS90
2006-06-20
Distance-regular graphs of hamming type.
160-167
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90071-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Nomura90
2006-06-20
Symmetric matroids.
54-64
1990
50
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90096-I
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Kalai90
2006-06-20
The long-line graph of a combinatorial geometry. II. Geometries representable over two fields of different characteristics.
41-53
1990
50
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90095-H
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Kung90
2006-06-20
Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions.
117-128
1990
50
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90100-E
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Diestel90a
2006-06-20
Isometric embeddings in Hamming graphs.
179-197
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90073-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Wilkeit90
2006-06-20
Powers of Hamilton cycles in tournaments.
309-318
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90085-E
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#BollobasH90
2006-06-20
On circuit decomposition of planar Eulerian graphs.
245-253
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90080-J
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#FleischnerF90
2006-06-20
Lifting map automorphisms and MacBeath's theorem.
135-149
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90069-C
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Surowski90
2006-06-20
The size of uniquely colorable graphs.
319-320
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90086-F
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Shaoji90
2006-06-20
Bidirectional retracting-free double tracings and upper embeddability of graphs.
198-207
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90074-A
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Thomassen90
2006-06-20
LP duality in infinite hypergraphs.
82-92
1990
50
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90098-K
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#AharoniZ90
2006-06-20
Perfectly contractile graphs.
222-230
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90077-D
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Bertschi90
2006-06-20
Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions.
93-116
1990
50
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90099-L
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Diestel90
2006-06-20
<i>k</i>-sets in a claw free graph.
241-244
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90079-F
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Hamidoune90
2006-06-20
A fast algorithm for coloring Meyniel graphs.
231-240
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90078-E
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Hertz90
2006-06-20
On adjoints and dual matroids.
208-213
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90075-B
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#AlfterKW90
2006-06-20
Unfriendly partitions of a graph.
1-10
1990
50
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90092-E
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#AharoniMP90
2006-06-20
Digraphs with degree equivalent induced subdigraphs.
288-298
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90083-C
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#JiongshengDQ90
2006-06-20
Intersection diagrams of distance-biregular graphs.
214-221
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90076-C
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Nomura90a
2006-06-20
An upper bound for the transversal numbers of 4-uniform hypergraphs.
129-133
1990
50
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90101-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#LaiC90
2006-06-20
Quantizers and the worst-case Euclidean traveling salesman problem.
65-81
1990
50
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90097-J
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Goddyn90
2006-06-20
Locally perfect graphs.
22-40
1990
50
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90094-G
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Preissmann90
2006-06-20
Counting 1-factors in infinite graphs.
168-178
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90072-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#AharoniZ90a
2006-06-20
A coloring problem related to the Erdös-Faber-Lovász conjecture.
321-322
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90087-G
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Horak90
2006-06-20
An intersection theorem for supermatroids.
150-159
1990
50
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90070-G
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb50.html#Tardos90
2006-06-21
Graph minors. IX. Disjoint crossed paths.
40-77
1990
49
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90063-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#RobertsonS90
2006-06-21
On the connectedness of some geometric graphs.
143-150
1990
49
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90023-S
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#Zaks90
2006-06-21
A generalized kneser conjecture.
236-240
1990
49
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90029-Y
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#Sarkaria90
2006-06-21
<i>K</i><sub><i>1, m</i></sub>-free graphs.
295-298
1990
49
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90033-V
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#Krasikov90
2006-06-21
Two-colourings that decompose perfect graphs.
1-9
1990
49
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90061-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#ChvatalLS90
2006-06-21
Murky graphs.
200-235
1990
49
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90028-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#Hayward90
2006-06-21
Resistances and currents in infinite electrical networks.
87-102
1990
49
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90065-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#Thomassen90a
2006-06-21
On the sibling-structure of perfect graphs.
282-286
1990
49
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90031-T
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#Hoang90
2006-06-21
Acyclic reorientations of weakly oriented matroids.
195-199
1990
49
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90027-W
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#Vergnas90
2006-06-21
On embedding graphs in trees.
103-136
1990
49
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90066-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#Bienstock90
2006-06-21
Undirected distances and the postman-structure of graphs.
10-39
1990
49
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90062-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#Sebo90
2006-06-21
Note on the girth of Ramanujan graphs.
190-194
1990
49
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90026-V
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#BiggsB90
2006-06-21
Covering weighted graphs by even subgraphs.
137-141
1990
49
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90067-A
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#Fan90
2006-06-21
Some localization theorems on hamiltonian circuits.
287-294
1990
49
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90032-U
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#HasratianK90
2006-06-21
A decomposition theory for matroids. V. Testing of matrix total unimodularity.
241-281
1990
49
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90030-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#Truemper90
2006-06-21
Quotients of dilworth truncations.
78-86
1990
49
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90064-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#Whittle90
2006-06-21
Long cycles and the codiameter of a graph, I.
151-180
1990
49
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90024-T
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#Fan90a
2006-06-21
A characterization of a class of non-binary matroids.
181-189
1990
49
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90025-U
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb49.html#Oxley90
2006-06-21
A characterization of Grassmann and Johnson graphs.
178-190
1990
48
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90116-H
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#Numata90
2006-06-21
Embeddings of graphs with no short noncontractible cycles.
155-177
1990
48
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90115-G
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#Thomassen90b
2006-06-21
<i>k</i>-connected graphs.
1-5
1990
48
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90126-K
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#Dean90
2006-06-21
Graph minors. VIII. A kuratowski theorem for general surfaces.
255-288
1990
48
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90121-F
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#RobertsonS90b
2006-06-21
Average distances in undirected graphs and the removal of vertices.
140-142
1990
48
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90136-N
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#Althofer90
2006-06-21
On graph invariants given by linear recurrence relations.
6-18
1990
48
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90127-L
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#Yetter90
2006-06-21
Map coloring and the vector cross product.
145-154
1990
48
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90114-F
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#Kauffman90
2006-06-21
Hamiltonian degree conditions which imply a graph is pancyclic.
111-116
1990
48
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90133-K
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#BauerS90
2006-06-21
A generalization of an inequality of Stepanov.
289-293
1990
48
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90122-G
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#Takacs90a
2006-06-21
A menger-like property of tree-width: The finite case.
67-76
1990
48
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90130-R
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#Thomas90
2006-06-21
The limiting probability that alpha-in, ß-out is strongly connected.
117-134
1990
48
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90134-L
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#CooperF90
2006-06-21
Edge-disjoint homotopic paths in a planar graph with one hole.
77-91
1990
48
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90131-I
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#HoeselS90
2006-06-21
<i>k</i><i>k</i>-cyclic digraphs.
216-226
1990
48
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90119-K
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#Manoussakis90
2006-06-21
Simplicial tree-decompositions of infinite graphs, I.
197-215
1990
48
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90118-J
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#Diestel90b
2006-06-21
Graph minors. IV. Tree-width and well-quasi-ordering.
227-254
1990
48
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90120-O
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#RobertsonS90a
2006-06-21
The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small.
45-66
1990
48
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90129-N
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#ChetwyndH90
2006-06-21
<i>Q</i>-polynomial property.
191-196
1990
48
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(90)90117-I
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#Leonard90
2006-06-21
Asymptotic enumeration of Latin rectangles.
19-44
1990
48
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90128-M
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#GodsilM90
2006-06-21
<i>H</i>-coloring.
92-110
1990
48
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90132-J
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#HellN90
2006-06-21
<i>P</i><sub>4</sub>-structure of Perfect Graphs. IV. Partner graphs.
135-139
1990
48
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(90)90135-M
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb48.html#HaywardL90
2006-06-21
A central limit theorem for decomposable random variables with applications to random graphs.
125-145
1989
47
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90014-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#BarbourKR89
2006-06-21
Characterizations of *-families.
107-110
1989
47
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90069-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#FukudaT89
2006-06-21
Biased graphs. I. Bias, balance, and gains.
32-52
1989
47
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90063-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#Zaslavsky89
2006-06-21
Discrete Jordan Curve Theorems.
251-261
1989
47
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(89)90027-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#VinceL89
2006-06-21
Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron.
192-219
1989
47
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90020-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#Freund89
2006-06-21
Radius, diameter, and minimum degree.
73-79
1989
47
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90066-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#ErdosPPT89
2006-06-21
On the independence numbers of a matroid.
146-152
1989
47
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90015-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#HamidouneS89
2006-06-21
Automorphism groups of symmetric graphs of valency 3.
60-72
1989
47
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90065-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#ConderL89
2006-06-21
Characterizations of ternary matroids in terms of circuit signatures.
93-106
1989
47
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90068-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#RoudneffW89
2006-06-21
Dowling group geometries and the critical problem.
80-92
1989
47
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90067-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#Whittle89
2006-06-21
<i>k</i>in directed graphs.
114-119
1989
47
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90071-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#AlonL89
2006-06-21
Genus distributions for bouquets of circles.
292-306
1989
47
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(89)90030-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#GrossRT89
2006-06-21
Isoperimetric numbers of graphs.
274-291
1989
47
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(89)90029-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#Mohar89
2006-06-21
A new conjecture about minimal imperfect graphs.
244-247
1989
47
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90024-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#MeynielO89
2006-06-21
Neighborhood unions and hamiltonian properties in graphs.
1-9
1989
47
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90060-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#FaudreeGJS89
2006-06-21
Combinatorial reconstruction problems.
153-161
1989
47
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90016-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#AlonCKR89
2006-06-21
<i>K</i><sub><i>n</i></sub>.
307-329
1989
47
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(89)90031-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#Ihrig89
2006-06-21
Kernels in some orientations of comparability graphs.
111-113
1989
47
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90070-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#Champetier89
2006-06-21
Extremal non-bipartite regular graphs of girth 4.
372-373
1989
47
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(89)90035-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#Dong-fang89
2006-06-21
On local structure of a distance-regular graph of Hamming type.
120-123
1989
47
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90072-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#Nomura89
2006-06-21
<i>K</i><sub>4</sub>.
330-348
1989
47
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(89)90032-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#Gerards89
2006-06-21
Euclidean intersection properties.
10-19
1989
47
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90061-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#BachemW89
2006-06-21
Slender graphs.
231-236
1989
47
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90022-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#Hertz89
2006-06-21
<i>K</i><sub><i>n</i></sub>.
262-273
1989
47
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(89)90028-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#Wilson89
2006-06-21
Long cycles through specified vertices in a graph.
220-230
1989
47
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90021-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#Saito89
2006-09-22
Grids and their minors.
349-360
1989
47
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(89)90033-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#SeeseW89
2006-06-21
Enumeration of Hamiltonian cycles in certain generalized Petersen graphs.
53-59
1989
47
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90064-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#Schwenk89
2006-06-21
Matroid Steiner problems, the Tutte polynomial and network reliability.
20-31
1989
47
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90062-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#ColbournP89
2006-06-21
A generalization of a result of Häggkvist and Nicoghossian.
237-243
1989
47
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90023-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#BauerBVR89
2006-06-22
<i>K</i><sub><i>n</i></sub>-free graphs.
162-170
1989
47
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90017-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#El-ZaharS89
2006-06-21
The Strong Perfect Graph Conjecture for pan-free graphs.
187-191
1989
47
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90019-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#Olariu89
2006-06-21
Graphs and groups with tree-like properties.
361-371
1989
47
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(89)90034-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#Woess89
2006-06-21
Longest cycles in triangle-free graphs.
171-186
1989
47
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90018-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb47.html#Aung89
2006-06-21
Hamiltonian decomposition of Cayley graphs of degree 4.
142-153
1989
46
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90040-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#BermondFM89
2006-06-21
Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs.
257-291
1989
46
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(89)90050-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#Thomassen89
2006-06-21
<i>G</i><i>G</i><i>k</i>.
356-362
1989
46
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(89)90055-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#EgawaM89
2006-06-21
<i>n</i>-cube that contain no 4-cycles.
346-355
1989
46
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(89)90054-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#JohnsonE89
2006-06-21
The 2-matching lattice of a graph.
246-248
1989
46
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90046-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#JungnickelL89
2006-06-21
A Delta-subgraph condition for a graph to be class 1.
37-45
1989
46
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90005-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#ChetwyndH89
2006-06-21
Minimal quadrangulations of orientable surfaces.
84-95
1989
46
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90009-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#HartsfieldR89a
2006-06-21
Cycle double covers of graphs with Hamilton paths.
253-254
1989
46
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90048-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#Goddyn89
2006-06-21
The total interval number of a graph.
7-21
1989
46
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90003-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#AndreaeA89
2006-06-21
Extending cycles in directed graphs.
162-172
1989
46
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90042-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#Hendry89
2006-06-21
Face sizes of 3-polytopes.
58-65
1989
46
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90007-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#BenderC89
2006-06-21
On the Delta-subgraph of graphs which are critical with respect to the chromatic index.
240-245
1989
46
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90045-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#ChetwyndHH89
2006-06-21
A length-width inequality for partially ordered sets with two-element cutsets.
232-239
1989
46
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90044-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#GinsburgSW89
2006-06-21
The Tutte polynomial of a ported matroid.
96-117
1989
46
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90010-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#Chaiken89
2006-06-21
On the chromatic number of a graph with two forbidden subgraphs.
1-6
1989
46
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90002-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#Dhurandhar89
2006-06-21
Unique graph homomorphisms onto odd cycles, II.
363-376
1989
46
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(89)90056-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#Lai89
2006-06-21
An upper bound on the shortness exponent of inscribable polytopes.
66-83
1989
46
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90008-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#Dillencourt89
2006-06-21
A Kuratowski theorem for nonorientable surfaces.
173-231
1989
46
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90043-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#ArchdeaconH89
2006-06-21
Chromatically optimal rigid graphs.
133-141
1989
46
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90039-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#NesetrilR89
2006-06-21
Decomposition and optimization over cycles in binary matroids.
306-337
1989
46
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(89)90052-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#GrotschelT89
2006-06-21
Clique covers and coloring problems of graphs.
338-345
1989
46
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(89)90053-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#Klotz89
2006-06-21
Cycle covering of binary matroids.
154-161
1989
46
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90041-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#JamshyT89
2006-06-21
Genus distributions for two classes of graphs.
22-36
1989
46
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90004-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#FurstGS89
2006-06-21
Non-hamiltonian bicubic graphs.
121-124
1989
46
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90012-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#Georges89
2006-06-21
For graphs there are only four types of hereditary Ramsey classes.
127-132
1989
46
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90038-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#Nesetril89
2006-06-21
Every 7-regular digraph contains an even cycle.
249-252
1989
46
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(89)90047-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#Friedland89
2006-06-21
Distances and cuts in planar graphs.
46-57
1989
46
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90006-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#Schrijver89
2006-06-21
The regular matroids with no 5-wheel minor.
292-305
1989
46
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(89)90051-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#Oxley89
2006-06-21
Extending a combinatorial geometry by adding a unique line.
118-120
1989
46
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(89)90011-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb46.html#Halsey89
2006-06-21
A cycle structure theorem for hamiltonian graphs.
99-107
1988
45
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90058-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#SchmeichelH88
2006-06-21
Trees in sparse random graphs.
77-85
1988
45
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90056-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#Vega88
2006-06-21
On the evaluation at (3, 3) of the Tutte polynomial of a graph.
367-372
1988
45
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90079-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#Vergnas88
2006-06-21
No antitwins in minimal imperfect graphs.
255-257
1988
45
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(88)90071-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#Olariu88a
2006-06-21
How to make a graph bipartite.
86-98
1988
45
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90057-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#ErdosFPS88
2006-06-21
Bipartable graphs.
1-12
1988
45
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90050-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#Hertz88
2006-06-21
The average size of an independent set in graphs with a given chromatic number.
112-114
1988
45
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90060-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#Nilli88
2006-06-21
Distance-regular antipodai covering graphs.
127-134
1988
45
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(88)90064-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#AldredG88
2006-06-21
Edge-colouring random graphs.
135-149
1988
45
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(88)90065-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#FriezeJMR88
2006-06-21
Large convex sets in oriented matroids.
293-304
1988
45
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90074-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#BuchiF88
2006-06-21
On the connectivity function of a matroid.
25-30
1988
45
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90052-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#Seymour88
2006-06-21
Nilpotent groups and transitive graphs.
356-366
1988
45
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90078-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#Seifter88
2006-06-21
On randomized stopping points and perfect graphs.
320-344
1988
45
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90076-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#DalangTW88
2006-06-21
The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices.
305-319
1988
45
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90075-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#HoltonM88
2006-07-14
Amalgamation of team tournaments.
115-119
1988
45
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90061-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#LakserMM88
2006-06-21
A characterization of undirected branching greedoids.
160-184
1988
45
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(88)90067-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#Schmidt88
2006-06-21
General factors of graphs.
185-198
1988
45
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(88)90068-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#Cornuejols88
2006-06-21
<i>k</i>-edge-connected graphs.
345-355
1988
45
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90077-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#Okamura88
2006-06-21
On the snake in the box problem.
13-24
1988
45
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90051-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#AbbottK88
2006-06-21
<i>m</i>-coloured tournaments.
108-111
1988
45
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90059-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#Minggang88
2006-06-21
Graph homomorphisms into the five-cycle.
199-211
1988
45
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(88)90069-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#Catlin88
2006-06-21
A decomposition theory for matroids IV. Decomposition of graphs.
259-292
1988
45
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90073-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#Truemper88
2006-06-21
Graphic presentations of isotropic systems.
58-76
1988
45
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90055-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#Bouchet88
2006-06-21
Matroidal bijections between graphs.
31-44
1988
45
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90053-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#LinialMT88
2006-07-03
<i>k</i><i>k</i>+ 1)-fach zusammenhängende Graphen.
45-57
1988
45
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90054-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#Mader88
2006-06-21
<i>K</i><sub>16</sub>'s.
120-124
1988
45
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90062-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#LaywineM88
2006-06-21
All variations on perfectly orderable graphs.
150-159
1988
45
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(88)90066-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#Olariu88
2006-06-21
A short proof of a theorem about the circumference of a graph.
373-375
1988
45
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90080-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#Feng88
2006-06-21
Graph minors. VII. Disjoint paths on a surface.
212-254
1988
45
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(88)90070-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb45.html#RobertsonS88
2006-06-21
The asymptotic number of acyclic digraphs, II.
363-369
1988
44
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90044-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#BenderR88
2006-06-21
On matroids induced by packing subgraphs.
338-354
1988
44
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90042-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#LoeblP88
2006-06-21
Matching extension and the genus of a graph.
329-337
1988
44
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90041-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#Plummer88
2006-06-21
Convex sets in graphs, II. Minimal path convexity.
307-316
1988
44
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90039-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#Duchet88
2006-06-22
The number of submatrices of a given type in a Hadamard matrix and related results.
317-328
1988
44
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90040-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#FranklRW88
2006-06-21
Matchings in infinite graphs.
87-125
1988
44
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90098-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#Aharoni88
2006-06-21
A remark on the intersection arrays of distance-regular graphs.
147-153
1988
44
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(88)90084-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#BoshierN88
2006-06-21
Hamilton cycles in regular 2-connected graphs.
177-186
1988
44
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(88)90086-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#BondyK88
2006-09-18
On bridged graphs and cop-win graphs.
22-28
1988
44
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90093-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#AnsteeF88
2006-06-21
Embeddings of infinite graphs.
29-43
1988
44
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90094-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#Mohar88
2006-06-21
Multiple residues in dimension three.
263-275
1988
44
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90036-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#FerriG88
2006-06-22
Recognizing claw-free perfect graphs.
154-176
1988
44
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(88)90085-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#ChvatalS88
2006-06-21
Local edge-connectivity in regular bipartite graphs.
370-371
1988
44
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90045-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#HamidouneV88
2006-06-21
Finding hamilton cycles in sparse random graphs.
230-250
1988
44
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(88)90089-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#Frieze88
2006-06-21
Algebraic characteristic sets of matroids.
64-74
1988
44
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90096-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#Gordon88
2006-06-21
Circular-arc graphs with clique cover number two.
300-306
1988
44
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90038-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#Spinrad88
2006-06-22
A compactness theorem for perfect matchings in matroids.
253-262
1988
44
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90035-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#KomjathMP88
2006-06-21
Cubic combinatorial maps.
44-63
1988
44
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90095-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#Little88
2006-06-21
On the problem of how to represent a graph taking into account an additional structure.
1-21
1988
44
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90092-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#Quilliot88
2006-06-22
Class one graphs.
372-376
1988
44
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90046-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#HoffmanR88
2006-06-21
Re-embedding of projective-planar graphs.
276-299
1988
44
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90037-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#Negami88
2006-06-21
On Tutte polynomials and cycles of plane graphs.
127-146
1988
44
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(88)90083-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#Jaeger88
2006-06-21
Subgraphs intersecting any hamiltonian cycle.
75-86
1988
44
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(88)90097-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#Horak88
2006-06-21
On relative position in extensions of combinatorial geometries.
201-229
1988
44
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(88)90088-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#CheungC88
2006-06-21
The Johnson-Lindenstrauss lemma and the sphericity of some graphs.
355-362
1988
44
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(88)90043-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#FranklM88
2006-06-21
Hypomorphisms, orbits, and reconstruction.
187-200
1988
44
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(88)90087-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb44.html#Kocay88
2006-06-21
A characterization of locally finite vertex-transitive graphs.
116-119
1987
43
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90033-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Thomassen87
2006-06-21
A remark on embedded bipartite graphs.
241-243
1987
43
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(87)90023-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Moran87
2006-06-21
Amalgamations of almost regular edge-colourings of simple graphs.
322-342
1987
43
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90008-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Nash-Williams87
2006-06-21
An additivity theorem for the genus of a graph.
25-47
1987
43
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90028-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Miller87
2006-06-21
On the genus and thickness of graphs.
287-292
1987
43
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90004-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Asano87
2006-06-21
Short circuit covers for regular matroids with a nowhere zero 5-flow.
354-357
1987
43
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90011-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#JamshyRT87
2006-06-21
Nowhere-zero integral chains and flows in bidirected graphs.
95-115
1987
43
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90032-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Khelladi87
2006-06-21
Hypercartes pointées sur le tore: Décompositions et dénombrements.
275-286
1987
43
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90003-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Arques87a
2006-06-21
A semi-strong Perfect Graph theorem.
223-240
1987
43
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(87)90022-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Reed87
2006-06-21
Menger's theorem for countable graphs.
303-313
1987
43
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90006-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Aharoni87
2006-06-21
Balanced decompositions of a signed graph.
1-13
1987
43
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90026-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Zaslavsky87
2006-06-21
A note on minimal directed graphs with given girth.
343-348
1987
43
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90009-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Hamidoune87
2006-06-21
Distance-regularised graphs are distance-regular or distance-biregular.
14-24
1987
43
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90027-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#GodsilS87
2006-06-21
On the non-orientable genus of a 2-connected graph.
48-59
1987
43
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90029-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Richter87
2006-06-21
Decomposition of perfect graphs.
70-94
1987
43
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90031-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Hsu87
2006-06-21
Relations fonctionnelles et dénombrement des cartes pointées sur le tore.
253-274
1987
43
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90002-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Arques87
2006-06-21
Strict refinement for graphs and digraphs.
140-150
1987
43
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(87)90018-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Walker87
2006-06-21
<i>P</i><sub>4</sub>-structure of perfect graphs III. Partner decompositions.
349-353
1987
43
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90010-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Chvatal87
2006-06-21
An inequality between intersection numbers of a distance-regular graph.
358-359
1987
43
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90012-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Nomura87
2006-06-22
<i>k</i>-colorings of graphs and hypergraphs.
127-139
1987
43
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(87)90017-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#GyarfasLNRST87
2006-06-21
<i>M</i>-solvable.
121-126
1987
43
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(87)90016-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Duchet87
2006-06-21
Oriented matroids from smooth manifolds.
173-186
1987
43
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(87)90020-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Miller87a
2006-06-21
<i>k</i>-edge deleted subgraphs.
360-363
1987
43
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90013-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#GodsilKR87
2006-06-21
Distance-regular digraphs of girth 4.
293-302
1987
43
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90005-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#EnomotoM87
2006-06-21
A circuit set characterization of antimatroids.
314-321
1987
43
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90007-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Dietrich87
2006-06-21
A Chvátal-Erdös condition for hamilton cycles in digraphs.
245-252
1987
43
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90001-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Jackson87
2006-06-21
On the Euler genus of a 2-connected graph.
60-69
1987
43
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90030-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Richter87a
2006-06-21
<i>K</i><sub><i>4</i></sub>-free graphs.
151-172
1987
43
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(87)90019-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Tucker87
2006-06-21
Matching structure and the matching lattice.
187-222
1987
43
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(87)90021-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb43.html#Lovasz87
2006-06-21
Characterization of even directed graphs.
36-45
1987
42
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90061-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#SeymourT87
2006-06-21
Handle bases and bounds on the number of subgraphs.
1-13
1987
42
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90058-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#DonaldEHS87
2006-06-21
On a conjecture of Meyniel.
302-312
1987
42
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90047-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Hoang87a
2006-06-21
Contractible edges in 3-connected graphs.
87-93
1987
42
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90065-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#AndoES87
2006-06-21
<i>P</i><i>Q</i><i>q</i>= -1.
64-67
1987
42
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90063-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Terwilliger87a
2006-06-21
The enumeration of akempic triangulations.
14-23
1987
42
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90059-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Mohar87
2006-06-21
A finite crisscross method for oriented matroids.
319-327
1987
42
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90049-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Terlaky87
2006-06-21
<i>k</i>-blocks.
24-35
1987
42
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90060-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Whittle87
2006-06-21
Large induced trees in sparse random graphs.
181-195
1987
42
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(87)90039-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#FriezeJ87
2006-06-21
An inequality for 3-polytopes.
156-166
1987
42
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(87)90037-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Roudneff87
2006-06-21
Counterexamples to Adám's conjecture on arc reversals in directed graphs.
128-130
1987
42
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90068-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Thomassen87a
2006-06-21
The biased graphs whose matroids are binary.
337-347
1987
42
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90051-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Zaslavsky87a
2006-06-21
Compatible path-cycle-decompositions of plane graphs.
94-121
1987
42
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90066-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#FleischnerJ87
2006-06-21
<i>k</i><i>k</i>-2)-connected graph.
371-377
1987
42
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90053-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Egawa87
2006-06-21
<i>M(K</i><sub><i>4</i></sub>)-minor.
212-249
1987
42
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(87)90041-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Oxley87
2006-06-21
Simplicial decompositions of graphs - Some uniqueness results.
133-145
1987
42
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(87)90035-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Diestel87
2006-06-21
Bandwidths and profiles of trees.
348-370
1987
42
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90052-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#OdlyzkoW87
2006-06-21
A family of nonreconstructible hypergraphs.
46-63
1987
42
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90062-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Kocay87
2006-06-21
Simplicial schemes.
68-86
1987
42
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90064-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Mohar87a
2006-06-21
Lower bounds for Ramsey numbers and association schemes.
122-127
1987
42
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(87)90067-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Mathon87
2006-06-21
Balanced vertex weightings and arborescences.
274-301
1987
42
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90046-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Berman87
2006-06-21
Score vectors of Kotzig tournaments.
328-336
1987
42
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90050-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#YucaiGJ87
2006-06-21
Alternating orientation and alternating colouration of perfect graphs.
264-273
1987
42
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90045-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Hoang87
2006-06-21
On weakly symmetric graphs of order twice a prime.
196-211
1987
42
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(87)90040-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#ChengO87
2006-06-21
<i>K</i><sub><i>4</i></sub><i>- e</i>)-free graphs.
313-318
1987
42
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90048-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Tucker87a
2006-06-21
5-connected 3-polytopes are refinements of octahedra.
250-254
1987
42
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(87)90042-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Barnette87
2006-06-21
Hamiltonian uniform subset graphs.
257-263
1987
42
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90044-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#ChenL87
2006-06-21
The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs.
167-180
1987
42
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(87)90038-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#BenhocineW87
2006-06-21
Generalized complementation.
378-383
1987
42
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(87)90054-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#McKee87
2006-06-21
Circuit preserving edge maps II.
146-155
1987
42
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(87)90036-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb42.html#Sanders87
2006-06-21
Geodetic graphs of diameter two and some related structures.
218-229
1986
41
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90045-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#Scapellato86
2006-06-21
On the chromatic index of multigraphs and a conjecture of Seymour (I).
306-331
1986
41
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(86)90053-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#Marcotte86
2006-06-21
<i>q</i>-hypergraphs.
356-385
1986
41
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(86)90056-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#Promel86
2006-07-11
Maximum induced trees in graphs.
61-79
1986
41
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90028-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#ErdosSS86
2006-06-21
Similarity reconstruction of trees.
235-245
1986
41
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90047-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#Taylor86
2006-06-21
Semi-duality and the cycle double cover conjecture.
332-340
1986
41
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(86)90054-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#Tarsi86
2006-06-21
Factors of regular graphs.
27-36
1986
41
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90025-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#Kano86
2006-06-21
Graphs determined by their finite induced subgraphs.
230-234
1986
41
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90046-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#Macpherson86
2006-06-21
Intersection graphs of paths in a tree.
141-181
1986
41
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90042-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#MonmaW86
2006-06-21
Distance-transitive representations of the symmetric groups.
255-274
1986
41
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(86)90051-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#Ivanov86
2006-06-21
<i>k</i>-leaf-connected graphs.
1-16
1986
41
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90023-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#GurgelW86
2006-06-21
Infinite paths that contain only shortest paths.
341-355
1986
41
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(86)90055-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#Watkins86
2006-06-21
Longest cycles in 3-connected cubic graphs.
17-26
1986
41
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90024-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#Jackson86
2006-06-21
Proportional transitivity in linear extensions of ordered sets.
48-60
1986
41
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90027-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#Fishburn86
2006-06-21
Distance-hereditary graphs.
182-208
1986
41
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90043-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#BandeltM86
2006-06-21
Graph minors. V. Excluding a planar graph.
92-114
1986
41
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90030-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#RobertsonS86
2006-06-21
<i>GF</i>(4).
250-252
1986
41
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90049-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#Oxley86
2006-06-21
Order properties of lines in the plane and a conjecture of G. Ringel.
246-249
1986
41
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90048-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#Vergnas86
2006-06-21
Graph minors. VI. Disjoint paths across a disc.
115-138
1986
41
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90031-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#RobertsonS86a
2006-06-21
Hypertrees and Bonferroni inequalities.
209-217
1986
41
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90044-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#Tomescu86
2006-06-21
The number of matchings in random regular graphs and bipartite graphs.
80-91
1986
41
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90029-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#BollobasM86
2006-06-21
A decomposition theory for matroids III. Decomposition conditions.
275-305
1986
41
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(86)90052-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#Truemper86
2006-06-21
On a pursuit game played on graphs for which a minor is excluded.
37-47
1986
41
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90026-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb41.html#Andreae86
2006-06-21
A common cover of graphs and 2-cell embeddings.
94-106
1986
40
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90067-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#Mohar86
2006-06-21
Minimally 3-connected graphs.
159-168
1986
40
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90074-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#Dawes86
2006-06-21
A note on Cayley graphs.
362-368
1986
40
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(86)90089-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#Conder86
2006-06-21
Extremal problems concerning Kneser graphs.
270-284
1986
40
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(86)90084-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#FranklF86a
2006-06-21
An exact threshold theorem for random graphs and the node-packing problem.
187-195
1986
40
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90076-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#Grimmett86
2006-06-21
Cayley digraphs of prime-power order are hamiltonian.
107-112
1986
40
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90068-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#Witte86
2006-06-21
Hamilton cycles in Euler tour graph.
1-8
1986
40
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90060-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#ZhangG86
2006-06-21
Signatures and signed switching classes.
344-361
1986
40
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(86)90088-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#CameronW86
2006-06-21
Relaxations of vertex packing.
330-343
1986
40
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(86)90087-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#GrotschelLS86
2006-06-21
The chromatic index of nearly bipartite multigraphs.
71-80
1986
40
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90065-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#EgganP86
2006-06-21
Perfect codes over graphs.
224-228
1986
40
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90079-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#Kratochvil86
2006-06-21
A survey of the asymptotic behaviour of maps.
297-329
1986
40
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(86)90086-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#BenderR86a
2006-07-03
<i>n</i>-fach kantenzusammenhängende Graphen.
152-158
1986
40
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90073-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#Mader86
2006-06-21
Concerning the achromatic number of graphs.
21-39
1986
40
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90062-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#FarberHHM86
2006-06-21
Directed Switching Games on graphs and matroids.
237-269
1986
40
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(86)90083-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#HamidouneV86
2006-06-21
On the cycle polytope of a binary matroid.
40-62
1986
40
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90063-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#BarahonaG86
2006-06-21
Switching classes of directed graphs.
169-186
1986
40
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90075-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#ChengW86
2006-06-21
An extension of matching theory.
285-296
1986
40
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(86)90085-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#CornuejolsH86
2006-06-21
Proof of the strong 2-Cover Conjecture for planar graphs.
229-230
1986
40
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90080-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#Fleischner86
2006-06-21
Interval representations of planar graphs.
9-20
1986
40
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90061-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#Thomassen86
2006-06-21
Representing abstract groups by powers of a graph.
81-93
1986
40
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90066-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#Vogler86
2006-06-21
<i>K</i><sub><i>n</i></sub>.
121-151
1986
40
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90072-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#Ihrig86
2006-06-21
Sphericity exceeds cubicity for almost all complete bipartite graphs.
231-235
1986
40
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90081-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#Maehara86
2006-06-21
<i>Q</i>-polynomial.
213-223
1986
40
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90078-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#Terwilliger86
2006-06-21
Spectral bounds for the clique and independence numbers of graphs.
113-117
1986
40
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90069-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#Wilf86
2006-06-21
Maximum matchings in a class of random graphs.
196-212
1986
40
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(86)90077-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#Frieze86
2006-10-23
An integer analogue of Carathéodory's theorem.
63-70
1986
40
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(86)90064-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb40.html#CookFS86
2006-06-21
Regular orientable imbeddings of complete graphs.
353-367
1985
39
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90060-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#JamesJ85
2006-06-21
<i>P</i><sub>4</sub>-structure of perfect graphs I. Even decompositions.
209-219
1985
39
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90051-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#ChvatalH85
2006-06-21
Longest cycles in regular graphs.
325-345
1985
39
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90058-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Fan85
2006-06-21
Nowhere zero flow and circuit covering in regular matroids.
346-352
1985
39
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90059-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Tarsi85
2006-06-21
Une relation fonctionnelle nouvelle sur les cartes planaires pointées.
27-42
1985
39
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(85)90036-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Arques85
2006-06-21
A decomposition theory for matroids. II. Minimal violation matroids.
282-297
1985
39
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90055-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Truemper85a
2006-09-08
Colouring the real line.
86-100
1985
39
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(85)90039-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#EggletonES85
2006-06-21
A decomposition theory for matroids. I. General results.
43-76
1985
39
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(85)90037-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Truemper85
2006-06-21
Connectivity in bicircular matroids.
308-324
1985
39
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90057-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Wagner85
2006-06-21
Distance-regular graphs with girth 3 or 4: I.
265-281
1985
39
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90054-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Terwilliger85
2006-06-21
Star-cutsets and perfect graphs.
189-199
1985
39
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90049-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Chvatal85
2006-06-21
A note about a theorem by maamoun on decompositions of digraphs into elementary directed paths or cycles.
368-370
1985
39
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90061-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Meyniel85
2006-06-21
Critical hypergraphs and intersecting set-pair systems.
134-145
1985
39
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(85)90043-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Tuza85
2006-06-21
<i>P</i><sub>4</sub>-structure of perfect graphs. II. Odd decompositions.
220-232
1985
39
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90052-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Hoang85
2006-06-21
On 1-factorizability of Cayley graphs.
298-307
1985
39
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90056-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Stong85
2006-06-21
The symmetric genus of alternating and symmetric groups.
179-186
1985
39
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(85)90047-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Conder85
2006-06-21
Edge-disjoint paths in planar graphs.
164-178
1985
39
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(85)90046-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Frank85a
2006-06-21
Weakly triangulated graphs.
200-208
1985
39
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90050-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Hayward85
2006-06-21
Cycle covering in bridgeless graphs.
146-152
1985
39
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(85)90044-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Fraisse85
2006-06-21
Linear and quadratic programming in oriented matroids.
105-133
1985
39
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(85)90042-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Todd85
2006-06-21
<i>k</i><i>k</i>-dependence.
101-102
1985
39
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(85)90040-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Favaron85
2006-06-21
On shortest cocycle covers of graphs.
153-163
1985
39
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(85)90045-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#JaegerKM85
2006-06-21
On cubic graphs which are irreducible for nonorientable surfaces.
233-264
1985
39
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90053-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#ArchdeaconH85
2006-06-21
Vertex-transitive triangulations of compact orientable 2-manifolds.
371-375
1985
39
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90062-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Surowski85
2006-06-21
Rank three permutation groups with rank three subconstituents.
1-16
1985
39
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(85)90034-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#CameronM85
2006-06-21
On a conjecture of bondy.
17-26
1985
39
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(85)90035-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#FournierF85
2006-06-21
On the unimodality of the independent set numbers of a class of matroids.
77-85
1985
39
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(85)90038-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb39.html#Mahoney85
2006-06-22
On color critical graphs.
204-213
1985
38
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90066-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#RodlT85
2006-06-22
Pendant tree-connectivity.
179-189
1985
38
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(85)90083-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#Hager85
2006-06-22
Hamiltonian cycles in cubic 3-connected bipartite planar graphs.
279-297
1985
38
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90072-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#HoltonMM85
2006-06-22
The edge intersection graphs of paths in a tree.
8-22
1985
38
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(85)90088-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#GolumbicJ85
2006-06-22
<sub>1</sub>, Isoperimetric inequalities for graphs, and superconcentrators.
73-88
1985
38
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(85)90092-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#AlonM85
2006-06-22
When a three-way fabric hangs together.
190
1985
38
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(85)90084-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#Clapham85
2006-06-22
A short note about pursuit games played on a graph with a given genus.
89-92
1985
38
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(85)90093-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#Quilliot85a
2006-06-22
On the graphical characterization of the projective space over a finite field.
143-155
1985
38
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(85)90080-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#Numata85
2006-06-22
No graph has a maximal 3-ring of bonds.
139-142
1985
38
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(85)90079-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#LittleH85
2006-06-22
The chromatic polynomial of an unlabeled graph.
226-239
1985
38
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90068-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#Hanlon85
2006-06-22
Even edge colorings of a graph.
93-94
1985
38
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(85)90094-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#AlonE85
2006-06-22
<i>K</i><sub>4</sub>and well-quasi-ordering.
240-247
1985
38
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90069-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#Thomas85
2006-06-26
Extremal subgraphs for two graphs.
248-260
1985
38
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90070-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#ChungES85
2006-06-22
Decompositions of digraphs into paths and cycles.
97-101
1985
38
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(85)90075-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#Maamoun85
2006-06-22
Heawood's empire problem.
168-178
1985
38
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(85)90082-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#JacksonR85
2006-06-22
Quotients of connected regular graphs of even degree.
214-225
1985
38
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90067-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#SiranS85
2006-07-03
<i>n</i>-fach zusammenhängende Digraphen.
102-117
1985
38
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(85)90076-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#Mader85
2006-06-22
A note on similar edges and edge-unique line graphs.
31-40
1985
38
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(85)90090-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#BangeBS85
2006-06-22
Distance-biregular graphs with 2-valent vertices and distance-regular line graphs.
193-203
1985
38
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90065-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#MoharS85
2006-06-22
Stability in CAN-free graphs.
23-30
1985
38
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(85)90089-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#HammerMW85
2006-06-22
Long cycles in bipartite graphs.
118-131
1985
38
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(85)90077-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#Jackson85
2006-06-22
Polymatroid greedoids.
41-72
1985
38
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(85)90091-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#KorteL85
2006-06-22
Reconstruction from vertex-switching.
132-138
1985
38
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(85)90078-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#Stanley85
2006-06-26
About some cyclic properties in digraphs.
261-278
1985
38
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(85)90071-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#HeydemannS85
2006-06-22
Interior graphs of maximal outerplane graphs.
156-167
1985
38
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(85)90081-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#HedetniemiPS85
2006-06-22
An edge extremal result for subcohesion.
1-7
1985
38
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(85)90087-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb38.html#BoeschM85
2006-06-22
A note on nongraphic matroids.
290-293
1984
37
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90062-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#AsanoNS84
2006-06-22
Every 4-regular graph plus an edge contains a 3-regular subgraph.
92-93
1984
37
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90048-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#AlonFK84a
2006-06-22
Generalized petersen graphs which are cycle permutation graphs.
142-150
1984
37
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(84)90068-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#StueckleR84
2006-06-22
A minimax theorem on intervals.
1-9
1984
37
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90039-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Gyori84
2006-06-22
<i>n</i>-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton.
283-289
1984
37
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90061-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#KhelladiP84
2006-06-22
Extremal non-bipartite regular graphs of girth 4.
64-69
1984
37
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90045-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Bauer84
2006-06-22
Clique graphs of time graphs.
270-278
1984
37
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90059-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Hedman84
2006-06-22
New sufficient conditions for cycles in graphs.
221-227
1984
37
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90054-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Fan84
2006-06-22
<i>G</i><i>n</i><i>k</i><i>n</i>geq 20.
173-188
1984
37
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(84)90070-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Moon84
2006-06-22
<i>k</i>-factor.
53-63
1984
37
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90044-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Hendry84
2006-06-22
A generalization of Tutte's 1-factor theorem to countable graphs.
199-209
1984
37
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90052-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Aharoni84
2006-06-22
A family of perfect graphs associated with directed graphs.
279-282
1984
37
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90060-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Kahn84a
2006-06-22
A refinement of Kuratowski's theorem.
245-253
1984
37
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90057-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Thomassen84
2006-06-22
Paths and edge-connectivity in graphs.
151-172
1984
37
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(84)90069-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Okamura84
2006-06-22
On the critical exponent of transversal matroids.
94-95
1984
37
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90049-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Whittle84
2006-06-22
Characterization of quadratic and cubic sigma-polynomials.
210-220
1984
37
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90053-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Dhurandhar84
2006-06-22
Independence in graphs with maximum degree four.
254-269
1984
37
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90058-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Jones84
2006-06-22
Pancyclic properties of the graph of some 0-1 polyhedra.
10-26
1984
37
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90040-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Naddef84
2006-06-22
Monotonicity of the mean order of subtrees.
70-78
1984
37
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90046-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Jamison84
2006-06-22
Injection geometries.
31-40
1984
37
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90042-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#DezaF84
2006-06-22
Distance degree regular graphs.
96-100
1984
37
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90050-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#HilanoN84
2006-06-22
Hamiltonicity in (0-1)-polyhedra.
41-52
1984
37
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90043-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#NaddefP84
2006-06-22
Maximum non-path-connected graphs.
294-298
1984
37
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90063-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Hendry84a
2006-06-22
Symmetric graphs and interpretations.
235-244
1984
37
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90056-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Welzl84
2006-06-22
On the length of optimal TSP circuits in sets of bounded diameter.
113-141
1984
37
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(84)90067-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Moran84a
2006-06-22
Bounds on graph spectra.
228-234
1984
37
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90055-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#BrighamD84
2006-06-22
Regular subgraphs of almost regular graphs.
79-91
1984
37
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90047-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#AlonFK84
2006-06-22
On Schmerl's effective version of Brooks' theorem.
27-30
1984
37
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90041-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Tverberg84
2006-06-22
Hamiltonian cycles in random regular graphs.
103-112
1984
37
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(84)90066-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#FennerF84
2006-06-22
On singleton 1-rounded sets of matroids.
189-197
1984
37
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(84)90071-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb37.html#Oxley84
2006-06-22
A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphs.
284-297
1984
36
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90034-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#Plesnik84
2006-06-22
Uniquely and faithfully embeddable projective-planar triangulations.
189-193
1984
36
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(84)90024-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#Negami84
2006-06-22
Even signings, signed switching classes, and (-1, 1)-matrices.
194-212
1984
36
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(84)90025-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#Wells84
2006-06-22
Graph decompositions without isolates.
16-25
1984
36
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90010-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#Linial84
2006-06-22
Duality and perfection for edges in cliques.
298-309
1984
36
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90035-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#AlbertsonC84
2006-06-22
On the chromatic index of multigraphs without large triangles.
156-160
1984
36
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(84)90022-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#Kierstead84
2006-06-22
A refined Hurwitz theorem for imbeddings of irredundant Cayley graphs.
244-268
1984
36
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90031-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#Tucker84
2006-06-22
There is one group of genus two.
269-275
1984
36
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90032-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#Tucker84a
2006-06-22
Embedding graphs in surfaces.
65-84
1984
36
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90014-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#HoffmanR84
2006-06-22
On the minimum order of graphs with given semigroup.
135-155
1984
36
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(84)90021-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#KoubekR84
2006-06-22
The acyclic sets of an oriented matroid.
26-31
1984
36
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90011-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#Edelman84
2006-06-22
Finding feasible vectors of Edmonds-Giles polyhedra.
221-239
1984
36
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90029-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#Frank84
2006-06-22
<i>k</i>-linked.
85-94
1984
36
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90015-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#HirataKS84
2006-06-22
A variation of Menger's theorem for long paths.
213-217
1984
36
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(84)90026-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#MontejanoN84
2006-06-22
<i>n</i>-space.
95-112
1984
36
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90016-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#Tay84
2006-06-22
Hamiltonian decompositions of complete graphs.
125-134
1984
36
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(84)90020-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#Hilton84
2006-06-22
The asymptotic enumeration of rooted convex polyhedra.
276-283
1984
36
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90033-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#BenderR84
2006-06-22
On optimal embeddings of metrics in graphs.
1-15
1984
36
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90009-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#ImrichSZ84
2006-06-22
Testing membership in matroid polyhedra.
161-188
1984
36
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(84)90023-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#Cunningham84
2006-06-22
Large graphs with given degree and diameter. II.
32-48
1984
36
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90012-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#BermondDF84
2006-06-22
<i>c</i>-nets.
118-123
1984
36
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90018-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#Liu84
2006-06-22
A bound for the number of tournaments with specified scores.
240-243
1984
36
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(84)90030-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#Gibson84
2006-06-22
Graph minors. III. Planar tree-width.
49-64
1984
36
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90013-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#RobertsonS84
2006-06-22
<i>N</i><sub>1</sub>.
113-117
1984
36
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(84)90017-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb36.html#Aharoni84a
2006-06-22
Hereditarily finite sets and identity trees.
142-155
1983
35
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90068-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#MeirMM83
2006-06-22
Prime interchange graphs of classes of matrices of zeros and ones.
156-170
1983
35
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90069-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#BrualdiM83
2006-06-22
<i>k</i>-closure.
247-255
1983
35
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90052-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#Yong-jinF83
2006-06-22
Erratum.
80
1983
35
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90082-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#Bondy83
2006-06-22
Packing and covering of crossing families of cuts.
104-128
1983
35
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90066-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#Schrijver83
2006-06-22
<i>W</i>-connectivity.
20-27
1983
35
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90077-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#Weixuan83
2006-06-22
<i>K</i><sub>n</sub>-free graphs.
193-200
1983
35
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90071-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#Bauer83
2006-06-22
A combinatorial analog of the Jordan Curve Theorem.
28-38
1983
35
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90078-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#Stahl83
2006-06-22
<i>k</i>-graceful, locally finite graphs.
319-322
1983
35
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90058-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#Slater83
2006-06-22
Edge-colorability of graph bundles.
12-19
1983
35
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90076-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#PisanskiSV83
2006-06-22
On 2-arc transitive graphs of girth 4.
1-11
1983
35
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90075-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#CameronP83
2006-06-22
Regular combinatorial maps.
256-277
1983
35
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90053-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#Vince83
2006-06-22
On the determinant of the adjacency matrix for a planar sublattice.
278-289
1983
35
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90054-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#DeiftT83
2006-06-22
From graphs to ortholattices and equivariant maps.
171-192
1983
35
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90070-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#Walker83
2006-06-22
Shortest coverings of graphs with cycles.
297-308
1983
35
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90056-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#BermondJJ83
2006-06-22
On Helly families of maximal size.
290-296
1983
35
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90055-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#BollobasD83
2006-06-22
Graphs with three mutually pseudo-similar vertices.
240-246
1983
35
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90051-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#GodsilK83
2006-06-22
The interval number of a planar graph: Three intervals suffice.
224-239
1983
35
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90050-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#ScheinermanW83
2006-06-22
On the average number of nodes in a subtree of a tree.
207-223
1983
35
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90049-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#Jamison83
2006-06-22
On the sphericity and cubicity of graphs.
309-318
1983
35
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90057-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#Fishburn83a
2006-06-22
Short cycles in directed graphs.
323-327
1983
35
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90059-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#ChvatalS83
2006-06-22
Graph minors. I. Excluding a forest.
39-61
1983
35
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90079-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#RobertsonS83
2006-06-22
Girth in graphs.
129-141
1983
35
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90067-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#Thomassen83
2006-06-22
Simple perfect square-cylinders of low order.
333-337
1983
35
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90061-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#AugusteijnD83
2006-06-22
Intersection numbers for coherent configurations and the spectrum of a graph.
201-204
1983
35
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90072-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#Walter83
2006-06-22
Operations on maps, and outer automorphisms.
93-103
1983
35
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90065-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#JonesT83
2006-06-22
Crossing-critical edges and Kuratowski subgraphs of a graph.
83-92
1983
35
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90064-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#Siran83
2006-06-22
Even edge colorings of a graph.
78-79
1983
35
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90081-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#Acharya83
2006-06-22
On the maximum cardinality of a consistent set of arcs in a random tournament.
328-332
1983
35
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90060-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#Vega83
2006-06-22
Upsets in round robin tournaments.
62-77
1983
35
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90080-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb35.html#BrualdiQ83
2006-06-22
Short proofs on the matching polyhedron.
104-108
1983
34
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90011-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Schrijver83a
2006-06-22
Lower bounds on the independence number in terms of the degrees.
22-39
1983
34
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90003-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Griggs83a
2006-06-22
Combinatorial maps.
1-21
1983
34
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90002-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Vince83a
2006-06-22
<i>M</i>leaves.
191-208
1983
34
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90019-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Kemp83
2006-06-22
The 2-homeotoxal tilings of the plane and the 2-sphere.
113-150
1983
34
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90014-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#GrunbaumS83
2006-06-22
Domination critical graphs.
65-76
1983
34
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90007-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#SumnerB83
2006-06-22
Enumeration of connected invariant graphs.
268-278
1983
34
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90040-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#BenderC83
2006-06-22
New results on finite polarized partition relations.
99-103
1983
34
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90010-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Sterboul83
2006-06-22
A class of hypergraphs satisfying an inequality of Lovász.
224-228
1983
34
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90021-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#CunquanW83
2006-06-22
Equitable and proportional coloring of trees.
177-186
1983
34
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90017-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#BollobasG83
2006-06-22
Non-hamiltonian 3-connected cubic bipartite graphs.
350-353
1983
34
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90046-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#EllinghamH83
2006-06-22
Sur la compatibilité des extensions ponctuelles d'un matroïde.
209-223
1983
34
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90020-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Cordovil83
2006-06-22
Graphs without quadrilaterals.
187-190
1983
34
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90018-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Furedi83
2006-06-22
The Ramsey number of a graph with bounded maximum degree.
239-243
1983
34
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90037-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#ChvatalRST83
2006-06-22
Coloring graphs with stable cutsets.
258-267
1983
34
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90039-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Tucker83a
2006-06-22
There is no fast method for finding monochromatic complete subgraphs.
58-64
1983
34
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90006-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Beck83
2006-06-22
Finite groups acting on surfaces and the genus of a group.
82-98
1983
34
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90009-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Tucker83
2006-06-22
On pseudosimilarity in trees.
323-339
1983
34
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90044-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#KirkpatrickKC83
2006-06-22
Deformations of plane graphs.
244-257
1983
34
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90038-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Thomassen83a
2006-06-22
Some geometrical aspects of a maximal three-coloured triangle-free graph.
313-322
1983
34
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90043-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Rigby83
2006-06-22
<i>s, c, a, k</i>)-graphs.
151-164
1983
34
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90015-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Terwilliger83
2006-06-22
On the number of 1-factors of locally finite graphs.
48-57
1983
34
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90005-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Bry83
2006-06-22
Alternating cycles in edge-partitioned graphs.
77-81
1983
34
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90008-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#GrossmanH83
2006-06-22
Large dense neighbourhoods and turán's theorem.
109-111
1983
34
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90012-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Bondy83a
2006-06-22
The classification of hamiltonian generalized Petersen graphs.
293-312
1983
34
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90042-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Alspach83
2006-06-22
A note on the probabilistic approach to Turán's problem.
340-349
1983
34
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90045-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Caen83
2006-06-22
Nowhere-zero integral flows on a bidirected graph.
279-292
1983
34
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(83)90041-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Bouchet83
2006-06-22
A factorization theorem for comaps of geometric lattices.
40-47
1983
34
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(83)90004-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Kung83
2006-06-22
<i>r</i>-neighborhoods.
165-176
1983
34
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90016-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Winkler83
2006-06-22
On intersection multigraphs of hypergraphs.
229-232
1983
34
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90022-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Lewin83
2006-06-22
Properties of matroids characterizable in terms of excluded matroids.
233-236
1983
34
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(83)90023-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb34.html#Asano83
2006-06-22
The lattice of convex sets of an oriented matroid.
239-244
1982
33
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90043-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb33.html#Edelman82
2006-06-22
Cycles of each length in tournaments.
245-255
1982
33
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90044-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb33.html#FengZC82
2006-06-22
On the existence of certain distance-regular graphs.
197-212
1982
33
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90039-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb33.html#RoosZ82
2006-06-22
The dichromatic number of a digraph.
265-270
1982
33
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90046-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb33.html#Neumann-Lara82
2006-06-22
On monochromatic paths in edge-coloured digraphs.
271-275
1982
33
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90047-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb33.html#SandsSW82
2006-06-22
<i>G</i><i>k</i><i>k</i><i>G</i><i>k</i><i>k</i>).
213-221
1982
33
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90040-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb33.html#Moon82a
2006-06-22
<i>G</i><i>n</i><i>k</i>) of the Johnson schemes.
256-264
1982
33
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90045-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb33.html#Moon82b
2006-06-22
Counting bridgeless graphs.
276-305
1982
33
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90048-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb33.html#HanlonR82
2006-06-22
Finite common coverings of graphs.
231-238
1982
33
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90042-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb33.html#Leighton82
2006-06-22
Generating the triangulations of the projective plane.
222-230
1982
33
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90041-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb33.html#Barnette82
2006-06-22
<i>k</i>-tuple colorings of cycles and other graphs.
90-94
1982
32
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(82)90079-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#BrighamD82
2006-06-22
Counting labelled three-connected and homeomorphically irreducible two-connected graphs.
1-11
1982
32
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(82)90072-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Walsh82
2006-06-22
A characterization of 3-connected graphs containing a given graph.
69-74
1982
32
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(82)90077-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Negami82
2006-06-22
<i>n</i>-skein isomorphisms of graphs.
103-111
1982
32
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(82)90027-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#HemmingerJ82
2006-06-22
Graphes orientes indécomposables en circuits hamiltoniens.
347-349
1982
32
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90010-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#AubertS82
2006-06-22
Extremals of functions on graphs with applications to graphs and hypergraphs.
246-257
1982
32
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90002-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#SosS82
2006-06-22
<i>GF</i>(3)-representability of matroids.
112-139
1982
32
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(82)90028-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Truemper82
2006-06-22
Extending an extension of Grinberg's theorem.
95-98
1982
32
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(82)90080-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Zaks82
2006-06-22
Couplages et transversaux généralisés d'un hypergraphe infini.
293-315
1982
32
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90006-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Polat82
2006-06-22
<i>r</i><i>r</i>-connected graphs.
231-245
1982
32
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90001-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#JacksonP82
2006-06-22
<i>k</i>-partite graphs.
223-228
1982
32
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(82)90037-5
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Ayel82
2006-06-22
On distance-regularity in graphs.
156-161
1982
32
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(82)90031-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Weichsel82
2006-06-22
Graph-encoded maps.
171-181
1982
32
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(82)90033-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Lins82
2006-06-22
A class of vertex-transitive digraphs, II.
336-346
1982
32
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90009-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#ChaoW82
2006-06-22
Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs.
258-263
1982
32
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90003-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Andreae82
2006-06-22
Vector transversals.
189-205
1982
32
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(82)90035-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Woodall82
2006-06-22
The diameter of bipartite distance-regular graphs.
182-188
1982
32
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(82)90034-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Terwilliger82
2006-06-22
Counting non-isomorphic three-connected planar maps.
33-44
1982
32
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(82)90074-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Walsh82b
2006-06-22
Interval mapping graphs and periodic points of continuous functions.
57-68
1982
32
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(82)90076-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Burkart82
2006-06-22
Obstructions for regular colorings.
326-335
1982
32
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90008-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Werra82
2006-06-22
Graphs with certain families of spanning trees.
162-170
1982
32
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(82)90032-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#ErdosFRS82
2006-06-22
An eigenvector condition for reconstructibility.
353-354
1982
32
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90012-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Yuan82
2006-06-22
Ordered colourings of graphs.
286-292
1982
32
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90005-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#CockayneT82
2006-06-22
Constructing graphs with pairs of pseudo-similar vertices.
146-155
1982
32
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(82)90030-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#GodsilK82
2006-06-22
Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs.
12-32
1982
32
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(82)90073-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Walsh82a
2006-06-22
<i>k</i>-independence problem.
350-352
1982
32
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90011-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Woodall82a
2006-06-22
Quasigroups defining Eulerian paths in complete graphs.
45-56
1982
32
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(82)90075-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#KotzigT82
2006-06-22
<i>k</i>-connected graphs.
206-222
1982
32
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(82)90036-3
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Locke82
2006-06-22
Cycles in bipartite tournaments.
140-145
1982
32
J. Comb. Theory, Ser. B
2
http://dx.doi.org/10.1016/0095-8956(82)90029-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#BeinekeL82
2006-06-22
Constructing a covering triangulation by means of a nowhere-zero dual flow.
316-325
1982
32
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90007-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Bouchet82
2006-06-22
Graphs having circuits with at least two chords.
264-285
1982
32
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(82)90004-1
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#Voss82
2006-06-22
On the enumeration of chains in regular chain-groups.
75-89
1982
32
J. Comb. Theory, Ser. B
1
http://dx.doi.org/10.1016/0095-8956(82)90078-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb32.html#ArrowsmithJ82
2006-06-22
Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs.
339-343
1981
31
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(81)90035-6
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb31.html#AinoucheC81
2006-06-22
Even circuits in planar graphs.
327-338
1981
31
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(81)90034-4
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb31.html#Seymour81
2006-06-22
Construction of class 2 graphs with maximum vertex degree 3.
282-291
1981
31
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(81)90030-7
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb31.html#Goldberg81
2006-06-22
Decompositions of complete graphs into isomorphic cubes.
292-296
1981
31
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(81)90031-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb31.html#Kotzig81
2006-06-22
Hamiltonian decomposition of lexicographic product.
253-261
1981
31
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(81)90028-9
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb31.html#BaranyaiS81
2006-06-22
Hamiltonicity and combinatorial polyhedra.
297-312
1981
31
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(81)90032-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb31.html#NaddefP81
2006-06-22
<i>K</i><sub>1, 3</sub>-free graphs.
313-326
1981
31
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(81)90033-2
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb31.html#GilesT81
2006-06-22
On a probabilistic method in graph theory.
344-347
1981
31
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(81)90036-8
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb31.html#GreenwellH81
2006-06-22
Graphes cubiques d'indice trois, graphes cubiques isochromatiques, graphes cubiques d'indice quatre.
262-281
1981
31
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(81)90029-0
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb31.html#FouquetJR81
2006-06-26
Universal caterpillars.
348-355
1981
31
J. Comb. Theory, Ser. B
3
http://dx.doi.org/10.1016/0095-8956(81)90037-X
http://www.informatik.uni-trier.de/~ley/db/journals/jct/jctb31.html#ChungGS81
2004-05-27
Decision making using minimization of regret.
109-128
2004
36
Int. J. Approx. Reasoning
2
http://dx.doi.org/10.1016/j.ijar.2003.10.003
http://www.informatik.uni-trier.de/~ley/db/journals/ijar/ijar36.html#Yager04