Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Comb.~Theory Series B AND Volume=45
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bipartable graphs
A. Hertz
Journal of Combinatorial Theory Series B
45
, 1988, pp. 1-12
On the snake in the box problem
H.L. Abbott
,
M. Katchalski
Journal of Combinatorial Theory Series B
45
, 1988, pp. 13-24
On the connectivity function of a matroid
P.D. Seymour
Journal of Combinatorial Theory Series B
45
, 1988, pp. 25-30
Matroidal bijections between graphs
Nathan Linial
,
Roy Meshulam
,
Michael Tarsi
Journal of Combinatorial Theory Series B
45
, 1988, pp. 31-44
über
(k+1)
-kritisch
(2k+1)
-fach zusammenhängende Graphen
W. Mader
Journal of Combinatorial Theory Series B
45
, 1988, pp. 45-57
Graphic presentations of isotropic systems
André Bouchet
Journal of Combinatorial Theory Series B
45
, 1988, pp. 58-76
Trees in sparse random graphs
W. Fernandez de la Vega
Journal of Combinatorial Theory Series B
45
, 1988, pp. 77-85
How to make a graph bipartite
Paul Erdŏs
,
Ralph Faudree
,
János Pach
,
Joel Spencer
Journal of Combinatorial Theory Series B
45
, 1988, pp. 86-98
A cycle structure theorem for Hamiltonian graphs
E.F. Schmeichel
,
S.L. Hakimi
Journal of Combinatorial Theory Series B
45
, 1988, pp. 99-107
On monochromatic paths in
m
-coloured tournaments
Shen Minggang
Journal of Combinatorial Theory Series B
45
, 1988, pp. 108-111
The average size of an independent set in graphs with a given chromatic number
A. Nilli
Journal of Combinatorial Theory Series B
45
, 1988, pp. 112-114
Amalgamation of team tournaments
H. Lakser
,
N.S. Mendelsohn
,
J.W. Moon
Journal of Combinatorial Theory Series B
45
, 1988, pp. 115-119
A simple construction giving the two non-isomorphic triangle-free 3-colored
K_{16}
's
C. Laywine
,
J.P. Mayberry
Journal of Combinatorial Theory Series B
45
, 1988, pp. 120-124
Distance-regular antipodal covering graphs
R.E.L. Aldred
,
C.D. Godsil
Journal of Combinatorial Theory Series B
45
, 1988, pp. 127-134
Edge-colouring random graphs
A.M. Frieze
,
B. Jackson
,
C.J.H. McDiarmid
,
B. Reed
Journal of Combinatorial Theory Series B
45
, 1988, pp. 135-149
All variations on perfectly orderable graphs
Stephan Olariu
Journal of Combinatorial Theory Series B
45
, 1988, pp. 150-159
A characterization of undirected branching greedoids
Wolfgang Schmidt
Journal of Combinatorial Theory Series B
45
, 1988, pp. 160-184
General factors of graphs
Gérard Cornuéjols
Journal of Combinatorial Theory Series B
45
, 1988, pp. 185-198
Graph homomorphisms into the five-cycle
Paul A. Catlin
Journal of Combinatorial Theory Series B
45
, 1988, pp. 199-211
Graph minors. VII. Disjoint paths on a surface
Neil Robertson
,
P.D. Seymour
Journal of Combinatorial Theory Series B
45
, 1988, pp. 212-254
No antitwins in minimal imperfect graphs
Stephan Olariu
Journal of Combinatorial Theory Series B
45
, 1988, pp. 255-257
A decomposition theory for matroids. IV. Decomposition of graphs
Klaus Truemper
Journal of Combinatorial Theory Series B
45
, 1988, pp. 259-292
Large convex sets in oriented matroids
J. Richard Buchi
,
William E. Fenton
Journal of Combinatorial Theory Series B
45
, 1988, pp. 293-304
The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
D.A. Holton
,
B.D. McKay
Journal of Combinatorial Theory Series B
45
, 1988, pp. 305-319
On randomized stopping points and perfect graphs
Robert C. Dalang
,
L.E., Jr. Trotter
,
D. de Werra
Journal of Combinatorial Theory Series B
45
, 1988, pp. 320-344
Seiten 1
2
>