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=47
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Neighborhood unions and Hamiltonian properties in graphs
R.J. Faudree
,
Ronald J. Gould
,
Michael S. Jacobson
,
R.H. Schelp
Journal of Combinatorial Theory Series B
47
, 1989, pp. 1-9
Euclidean intersection properties
Achim Bachem
,
Alfred Wanka
Journal of Combinatorial Theory Series B
47
, 1989, pp. 10-19
Matroid Steiner problems, the Tutte polynomial and network reliability
Charles J. Colbourn
,
William R. Pulleyblank
Journal of Combinatorial Theory Series B
47
, 1989, pp. 20-31
Biased graphs. I. Bias, balance, and gains
Thomas Zaslavsky
Journal of Combinatorial Theory Series B
47
, 1989, pp. 32-52
Enumeration of Hamiltonian cycles in certain generalized Petersen graphs
Allen J. Schwenk
Journal of Combinatorial Theory Series B
47
, 1989, pp. 53-59
Automorphism groups of symmetric graphs of valency 3
Marston Conder
,
Peter Lorimer
Journal of Combinatorial Theory Series B
47
, 1989, pp. 60-72
Radius, diameter, and minimum degree
Paul Erdŏs
,
János Pach
,
Richard Pollack
,
Zsolt Tuza
Journal of Combinatorial Theory Series B
47
, 1989, pp. 73-79
Dowling group geometries and the critical problem
Geoff Whittle
Journal of Combinatorial Theory Series B
47
, 1989, pp. 80-92
Characterizations of ternary matroids in terms of circuit signatures
Jean-Pierre Roudneff
,
Marc Wagowski
Journal of Combinatorial Theory Series B
47
, 1989, pp. 93-106
Characterizations of *-families
Komei Fukuda
,
Akihisa Tamura
Journal of Combinatorial Theory Series B
47
, 1989, pp. 107-110
Kernels in some orientations of comparability graphs
Christophe Champetier
Journal of Combinatorial Theory Series B
47
, 1989, pp. 111-113
Cycles of length 0 modulo
k
in directed graphs
Noga Alon
,
N. Linial
Journal of Combinatorial Theory Series B
47
, 1989, pp. 114-119
On local structure of a distance-regular graph of Hamming type
Kazumasa Nomura
Journal of Combinatorial Theory Series B
47
, 1989, pp. 120-123
A central limit theorem for decomposable random variables with applications to random graphs
A.D. Barbour
,
Michal Karoński
,
Andrzej Ruciński
Journal of Combinatorial Theory Series B
47
, 1989, pp. 125-145
On the independence numbers of a matroid
Yahya Ould Hamidoune
,
Isabelle Salaün
Journal of Combinatorial Theory Series B
47
, 1989, pp. 146-152
Combinatorial reconstruction problems
N. Alon
,
Y. Caro
,
I. Krasikov
,
Y. Roditty
Journal of Combinatorial Theory Series B
47
, 1989, pp. 153-161
The indivisibility of the homogeneous
K_n
-free graphs
M. El-Zahar
,
N. Sauer
Journal of Combinatorial Theory Series B
47
, 1989, pp. 162-170
Longest cycles in triangle-free graphs
Min Aung
Journal of Combinatorial Theory Series B
47
, 1989, pp. 171-186
The strong perfect graph conjecure for pan-free graphs
Stephan Olariu
Journal of Combinatorial Theory Series B
47
, 1989, pp. 187-191
Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron
Robert M. Freund
Journal of Combinatorial Theory Series B
47
, 1989, pp. 192-219
Long cycles through specified vertices in a graph
Akira Saito
Journal of Combinatorial Theory Series B
47
, 1989, pp. 220-230
Slender graphs
A. Hertz
Journal of Combinatorial Theory Series B
47
, 1989, pp. 231-236
A generalization of a result of Häggkvist and Nicoghossian
Douglas Bauer
,
H.J. Broersma
,
H.J. Veldman
,
Li Rao
Journal of Combinatorial Theory Series B
47
, 1989, pp. 237-243
A new conjecture about minimal imperfect graphs
H. Meyniel
,
S. Olariu
Journal of Combinatorial Theory Series B
47
, 1989, pp. 244-247
Discrete Jordan curve theorems
Andrew Vince
,
C.H.C. Little
Journal of Combinatorial Theory Series B
47
, 1989, pp. 251-261
Seiten 1
2
>