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=30
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Quelques problèmes de connexité dans les graphes orientés
Yahya Ould Hamidoune
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 1-10
An analogue of group divisible designs for Moore graphs
R.P. Anstee
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 11-20
Spanning subgraphs of
k
-connected digraphs
Daniel A. Marcus
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 21-31
q
-coverings, codes, and line graphs
Peter Hammond
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 32-35
Planar cubic hypohamiltonian and hypotraceable graphs
Carsten Thomassen
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 36-44
Forest embeddings in regular graphs of large girth
D.G. Kirkpatrick
,
D.G. Corneil
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 45-60
On a generalization of linear independence in finite-dimensional vector spaces
Martin Feinberg
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 61-69
The strong perfect graph conjecture for toroidal graphs
Charles Grinstead
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 70-74
Decomposition of
K_{m,n}
(
K_{m,n}^*
) into cycles (circuits) of length
2k
D. Sotteau
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 75-81
Three-colourings of planar 4-valent maps
Kenneth A. Berman
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 82-88
Burnside's lemma: A historical note
E.M. Wright
Journal of Combinatorial Theory Series B
30
, 1981, pp. 89-90
A conjecture on sets of differences of integer pairs
D. Perrin
,
M. Schützenberger
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 91-93
On matroid connectivity
William H. Cunningham
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 94-99
Note on a theorem of J. Folkman on transversals of infinite families with finitely many infinite members
François Bry
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 100-102
Hall-conditions and the three-family problem
C. Zaverdinos
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 103-107
On multiply critically
h
-connected graphs
Yahya Ould Hamidoune
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 108-112
On the radius of graphs
Jochen Harant
,
Hansjoachim Walther
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 113-117
A remark on Hamiltonian cycles
Roland Häggkvist
,
G.G. Nicoghossian
Journal of Combinatorial Theory Series B
30
(1), 1981, February, pp. 118-120
The basis number of a graph
Edward F. Schmeichel
Journal of Combinatorial Theory Series B
30
(2), 1981, April, pp. 123-129
Nowhere-zero 6-flows
P.D. Seymour
Journal of Combinatorial Theory Series B
30
(2), 1981, April, pp. 130-135
X^k
-digraphs
W.G. Bridges
,
R.A. Mena
Journal of Combinatorial Theory Series B
30
(2), 1981, April, pp. 136-143
Difference systems, graph designs, and coloring problems
John B. Kelly
Journal of Combinatorial Theory Series B
30
(2), 1981, April, pp. 144-165
Connected graphs with a minimal number of spanning trees
N. Gaffke
Journal of Combinatorial Theory Series B
30
(2), 1981, April, pp. 166-183
Finite common coverings of pairs of regular graphs
Dana Angluin
,
A. Gardiner
Journal of Combinatorial Theory Series B
30
(2), 1981, April, pp. 184-187
The reconstruction of maximal planar graphs. I. Recognition
S. Fiorini
,
J. Lauri
Journal of Combinatorial Theory Series B
30
(2), 1981, April, pp. 188-195
Seiten 1
2
>