Login
|
New Account
ITA
ENG
Results:
1-25
|
26-50
|
51-75
|
76-100
|
>>
Table of contents of journal:
*Journal of combinatorial theory. Series B (Print)
Results: 1-25/545
About skew partitions in minimal imperfect graphs
Authors:
Roussel, F Rubio, P
Citation:
F. Roussel et P. Rubio, About skew partitions in minimal imperfect graphs, J COMB TH B, 83(2), 2001, pp. 171-190
Dynamic monopolies of constant size
Authors:
Berger, E
Citation:
E. Berger, Dynamic monopolies of constant size, J COMB TH B, 83(2), 2001, pp. 191-200
Planar graphs of maximum degree seven are class I
Authors:
Sanders, DP Zhao, Y
Citation:
Dp. Sanders et Y. Zhao, Planar graphs of maximum degree seven are class I, J COMB TH B, 83(2), 2001, pp. 201-212
Partitioning vertices of a tournament into independent cycles
Authors:
Chen, GT Gould, RJ Li, H
Citation:
Gt. Chen et al., Partitioning vertices of a tournament into independent cycles, J COMB TH B, 83(2), 2001, pp. 213-220
On a conjecture about trees in graphs with large girth
Authors:
Jiang, T
Citation:
T. Jiang, On a conjecture about trees in graphs with large girth, J COMB TH B, 83(2), 2001, pp. 221-232
On the spectral radius of graphs with cut vertices
Authors:
Berman, A Zhang, XD
Citation:
A. Berman et Xd. Zhang, On the spectral radius of graphs with cut vertices, J COMB TH B, 83(2), 2001, pp. 233-240
Choosability in random hypergraphs
Authors:
Krivelevich, M Vu, VH
Citation:
M. Krivelevich et Vh. Vu, Choosability in random hypergraphs, J COMB TH B, 83(2), 2001, pp. 241-257
An equivalent version of the 3-flow conjecture
Authors:
Kochol, M
Citation:
M. Kochol, An equivalent version of the 3-flow conjecture, J COMB TH B, 83(2), 2001, pp. 258-261
Decomposing a planar graph into an independent set and a 3-degenerate graph
Authors:
Thomassen, C
Citation:
C. Thomassen, Decomposing a planar graph into an independent set and a 3-degenerate graph, J COMB TH B, 83(2), 2001, pp. 262-271
On the chromatic roots of generalized theta graphs
Authors:
Brown, JI Hickman, C Sokal, AD Wagner, DG
Citation:
Ji. Brown et al., On the chromatic roots of generalized theta graphs, J COMB TH B, 83(2), 2001, pp. 272-297
Irreducibility of the Tutte polynomial of a connected matroid
Authors:
Merino, C de Mier, A Noy, M
Citation:
C. Merino et al., Irreducibility of the Tutte polynomial of a connected matroid, J COMB TH B, 83(2), 2001, pp. 298-304
Almost all 3-connected graphs contain a contractible set of k vertices
Authors:
Kriesell, M
Citation:
M. Kriesell, Almost all 3-connected graphs contain a contractible set of k vertices, J COMB TH B, 83(2), 2001, pp. 305-319
A transformation which preserves the clique number
Authors:
Gerber, MU Hertz, A
Citation:
Mu. Gerber et A. Hertz, A transformation which preserves the clique number, J COMB TH B, 83(2), 2001, pp. 320-330
Covering a strong digraph by a-1 disjoint paths: A proof of Las Vergnas' conjecture
Authors:
Thomasse, SP
Citation:
Sp. Thomasse, Covering a strong digraph by a-1 disjoint paths: A proof of Las Vergnas' conjecture, J COMB TH B, 83(2), 2001, pp. 331-333
High-girth graphs avoiding a minor are nearly bipartite
Authors:
Galluccio, A Goddyn, LA Hell, P
Citation:
A. Galluccio et al., High-girth graphs avoiding a minor are nearly bipartite, J COMB TH B, 83(1), 2001, pp. 1-14
Matroid 4-connectivity: A deletion-contraction theorem
Authors:
Geelen, J Whittle, G
Citation:
J. Geelen et G. Whittle, Matroid 4-connectivity: A deletion-contraction theorem, J COMB TH B, 83(1), 2001, pp. 15-37
Flexibility of polyhedral embeddings of graphs in surfaces
Authors:
Mohar, B Robertson, N
Citation:
B. Mohar et N. Robertson, Flexibility of polyhedral embeddings of graphs in surfaces, J COMB TH B, 83(1), 2001, pp. 38-57
Graph imperfection
Authors:
Gerke, S McDiarmid, C
Citation:
S. Gerke et C. Mcdiarmid, Graph imperfection, J COMB TH B, 83(1), 2001, pp. 58-78
Graph imperfection II
Authors:
Gerke, S McDiarmid, C
Citation:
S. Gerke et C. Mcdiarmid, Graph imperfection II, J COMB TH B, 83(1), 2001, pp. 79-101
A new bound on the cyclic chromatic number
Authors:
Sanders, DP Zhao, Y
Citation:
Dp. Sanders et Y. Zhao, A new bound on the cyclic chromatic number, J COMB TH B, 83(1), 2001, pp. 102-111
A characterization of weakly bipartite graphs
Authors:
Guenen, B
Citation:
B. Guenen, A characterization of weakly bipartite graphs, J COMB TH B, 83(1), 2001, pp. 112-168
A new upper bound on the Cheeger number of a graph
Authors:
Dragomir, S Barletta, E
Citation:
S. Dragomir et E. Barletta, A new upper bound on the Cheeger number of a graph, J COMB TH B, 82(2), 2001, pp. 167-174
A characterisation of Pfaffian near bipartite graphs
Authors:
Fischer, I
Citation:
I. Fischer, A characterisation of Pfaffian near bipartite graphs, J COMB TH B, 82(2), 2001, pp. 175-222
Steinitz representations of polyhedra and the Colin de Verdiere number
Authors:
Lovasz, L
Citation:
L. Lovasz, Steinitz representations of polyhedra and the Colin de Verdiere number, J COMB TH B, 82(2), 2001, pp. 223-236
On the largest component of the random graph at a nearcritical stage
Authors:
Pittel, B
Citation:
B. Pittel, On the largest component of the random graph at a nearcritical stage, J COMB TH B, 82(2), 2001, pp. 237-269
Risultati:
1-25
|
26-50
|
51-75
|
76-100
|
>>