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
[2]
Hilfe
Suche: Journal=J. Comb.~Theory Series B AND Volume=32
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Couplages et transversaux généralisés d'un hypergraphe infini
Norbert Polat
Journal of Combinatorial Theory Series B
32
, 1982, pp. 293-315
Constructing a covering triangulation by means of a nowhere-zero dual flow
André Bouchet
Journal of Combinatorial Theory Series B
32
, 1982, pp. 316-325
Obstructions for regular colorings
D. de Werra
Journal of Combinatorial Theory Series B
32
, 1982, pp. 326-335
A class of vertex-transitive digraphs, II
Chong-Yun Chao
,
Jacqueline G. Wells
Journal of Combinatorial Theory Series B
32
, 1982, pp. 336-346
Graphes orientés indécomposables en circuits hamiltoniens
J. Aubert
,
B. Schneider
Journal of Combinatorial Theory Series B
32
, 1982, pp. 347-349
Some notes on Feinberg's
k
-independence problem
D.R. Woodall
Journal of Combinatorial Theory Series B
32
, 1982, pp. 350-352
An eigenvector condition for reconstructibility
Hong Yuan
Journal of Combinatorial Theory Series B
32
, 1982, pp. 353-354
Seiten
<
1
2