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
[1]
Hilfe
Suche: Journal=J. Comb.~Theory Series B AND YEAR=1990
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the inversion of the sign of one basis in an oriented matroid
W. Bienia
,
I.P. da Silva
Journal of Combinatorial Theory Series B
50
, 1990, pp. 299-308
Powers of Hamilton cycles in tournaments
Béla Bollobás
,
Roland Häggkvist
Journal of Combinatorial Theory Series B
50
, 1990, pp. 309-318
The size of uniquely colorable graphs
Xu Shaoji
Journal of Combinatorial Theory Series B
50
, 1990, pp. 319-320
A coloring problem related to the Erdŏs-Faber-Lovász conjecture
Peter Horák
Journal of Combinatorial Theory Series B
50
, 1990, pp. 321-322
Two-colourings that decompose perfect graphs
Vas̑ek Chvátal
,
William J. Lenhart
,
Najiba Sbihi
Journal of Combinatorial Theory Series B
49
, 1990, pp. 1-9
Undirected distances and the postman-structure of graphs
András Sebŏ
Journal of Combinatorial Theory Series B
49
, 1990, pp. 10-39
Graph minors. IX. Disjoint crossed paths
Neil Robertson
,
P.D. Seymour
Journal of Combinatorial Theory Series B
49
, 1990, pp. 40-77
Quotients of Dilworth truncations
Geoffrey Whittle
Journal of Combinatorial Theory Series B
49
, 1990, pp. 78-86
Resistances and currents in infinite electrical networks
Carsten Thomassen
Journal of Combinatorial Theory Series B
49
, 1990, pp. 87-102
On embedding graphs in trees
Dan Bienstock
Journal of Combinatorial Theory Series B
49
, 1990, pp. 103-136
Covering weighted graphs by even subgraphs
Genghua Fan
Journal of Combinatorial Theory Series B
49
, 1990, pp. 137-141
On the connectedness of some geometric graphs
Joseph Zaks
Journal of Combinatorial Theory Series B
49
, 1990, pp. 143-150
Long cycles and the codiameter of a graph, I
Genghua Fan
Journal of Combinatorial Theory Series B
49
, 1990, pp. 151-180
A characterization of a class of non-binary matroids
James G. Oxley
Journal of Combinatorial Theory Series B
49
, 1990, pp. 181-189
Note on the girth of Ramanujan graphs
N.L. Biggs
,
A.G. Boshier
Journal of Combinatorial Theory Series B
49
, 1990, pp. 190-194
Acyclic reorientations of weakly oriented matroids
Michel las Vergnas
Journal of Combinatorial Theory Series B
49
, 1990, pp. 195-199
Murky graphs
Ryan B. Hayward
Journal of Combinatorial Theory Series B
49
, 1990, pp. 200-235
A generalized Kneser conjecture
K.S. Sarkaria
Journal of Combinatorial Theory Series B
49
, 1990, pp. 236-240
A decomposition theory for matroids. V. Testing of matrix total unimodularity
Klaus Truemper
Journal of Combinatorial Theory Series B
49
, 1990, pp. 241-281
On the sibling-structure of perfect graphs
C.T. Hoàng
Journal of Combinatorial Theory Series B
49
, 1990, pp. 282-286
Some localization theorems on Hamiltonian circuits
A.S. Hasratian
,
N.K. Khachatrian
Journal of Combinatorial Theory Series B
49
, 1990, pp. 287-294
A note on the edge-reconstruction of
K_{1,m}
-free graphs
I. Krasikov
Journal of Combinatorial Theory Series B
49
, 1990, pp. 295-298
Distribution of contractible edges in
k
-connected graphs
Nathaniel Dean
Journal of Combinatorial Theory Series B
48
, 1990, pp. 1-5
On graph invariants given by linear recurrence relations
David N. Yetter
Journal of Combinatorial Theory Series B
48
, 1990, pp. 6-18
Asymptotic enumeration of Latin rectangles
C.D. Godsil
,
B.D. McKay
Journal of Combinatorial Theory Series B
48
, 1990, pp. 19-44
Seiten
<
1
2
3
>