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=21
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Chromatic numbers of infinite graphs
M. Behzad
,
H. Radjavi
Journal of Combinatorial Theory Series B
21
, 1976, pp. 195-200
On graphs with diameter 2
Béla Bollobás
,
Stephen Eldridge
Journal of Combinatorial Theory Series B
21
, 1976, pp. 201-205
On parity patterns of even
Q
-angulations
F. Jaeger
Journal of Combinatorial Theory Series B
21
, 1976, pp. 206-211
The strong perfect-graph conjecture is true for
K_{1,3}
-free graphs
K.R. Parthasarathy
,
G. Ravindra
Journal of Combinatorial Theory Series B
21
, 1976, pp. 212-223
Pairs of sequences with a unique realization by bipartite graphs
Michael Koren
Journal of Combinatorial Theory Series B
21
, 1976, pp. 224-234
Sequences with a unique realization by simple graphs
Michael Koren
Journal of Combinatorial Theory Series B
21
, 1976, pp. 235-244
Infinite digraphs isomorphic with their line digraphs
Lowell W. Beineke
,
Robert L. Hemminger
Journal of Combinatorial Theory Series B
21
, 1976, pp. 245-256
Some cases of triangular imbeddings for
K_{n(m)}
Dominique Bénard
,
André Bouchet
Journal of Combinatorial Theory Series B
21
, 1976, pp. 257-269
Asymptotic formulas for the number of oriented graphs
Detlef Wille
Journal of Combinatorial Theory Series B
21
, 1976, pp. 270-274
Glatt einbettbare Untergraphen
Richard Weiss
Journal of Combinatorial Theory Series B
21
, 1976, pp. 275-281
A note on uniquely reducible graphs
David Merriell
Journal of Combinatorial Theory Series B
21
, 1976, pp. 282-284
Seiten
<
1
2