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=51
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Edge-disjoint in- and out-branchings in tournaments and related path problems
Jrgen Bang-Jensen
Journal of Combinatorial Theory Series B
51
, 1991, pp. 1-23
Short-chorded and perfect graphs
Anna Lubiw
Journal of Combinatorial Theory Series B
51
, 1991, pp. 24-33
Clique graphs and Helly graphs
Hans-Jürgen Bandelt
,
Erich Prisner
Journal of Combinatorial Theory Series B
51
, 1991, pp. 34-45
Biased graphs. II. The three matroids
Thomas Zaslavsky
Journal of Combinatorial Theory Series B
51
, 1991, pp. 46-72
Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
David A. Gregory
,
Norman J. Pullman
,
Kathryn F. Jones
,
J. Richard Lundgren
Journal of Combinatorial Theory Series B
51
, 1991, pp. 73-89
Vertex coverings by monochromatic cycles and trees
P. Erdŏs
,
A. Gyárfás
,
L. Pyber
Journal of Combinatorial Theory Series B
51
, 1991, pp. 90-95
Broken circuit complexes: Factorizations and generalizations
Anders Björner
,
Günter M. Ziegler
Journal of Combinatorial Theory Series B
51
, 1991, pp. 96-126
Disjoint circuits of prescribed homotopies in a graph on a compact surface
A. Schrijver
Journal of Combinatorial Theory Series B
51
, 1991, pp. 127-159
Decomposition of graphs on surfaces and a homotopic circulation theorem
A. Schrijver
Journal of Combinatorial Theory Series B
51
, 1991, pp. 161-210
K
-elimination property for circuits and matroids
Manoel Lemos
Journal of Combinatorial Theory Series B
51
, 1991, pp. 211-226
Topological aspects of edge fusions in 4-graphs
Massimo Ferri
,
Sóstenes Lins
Journal of Combinatorial Theory Series B
51
, 1991, pp. 227-243
Non-symmetric, metric, cometric association schemes are self-dual
Douglas A. Leonard
Journal of Combinatorial Theory Series B
51
, 1991, pp. 244-247
A Mengerian theorem for infinite graphs with ideal points
Norbert Polat
Journal of Combinatorial Theory Series B
51
, 1991, pp. 248-255
On the classification of plane graphs representing structurally stable rational Newton flows
H.Th. Jongen
,
P. Jonker
,
F. Twilt
Journal of Combinatorial Theory Series B
51
, 1991, pp. 256-270
On the diameter of the edge cover polytope
C.A.J. Hurkens
Journal of Combinatorial Theory Series B
51
, 1991, pp. 271-276
Generating projective plane polyhedral maps
D.W. Barnette
Journal of Combinatorial Theory Series B
51
, 1991, pp. 277-291
Extending cycles in bipartite graphs
George R.T. Hendry
Journal of Combinatorial Theory Series B
51
, 1991, pp. 292-313
On nonsymmetric
P
- and
Q
-polynomial association schemes
Akihiro Munemasa
Journal of Combinatorial Theory Series B
51
, 1991, pp. 314-328