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 YEAR=1987
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Parity graphs are kernel-
M
-solvable
Pierre Duchet
Journal of Combinatorial Theory Series B
43
, 1987, pp. 121-126
Local
k
-colorings of graphs and hypergraphs
A. Gyárfás
,
J. Lehel
,
J. Nes̑etȓil
,
V. Rödl
,
R.H. Schelp
,
Zs. Tuza
Journal of Combinatorial Theory Series B
43
, 1987, pp. 127-139
Strict refinement for graphs and digraphs
James W. Walker
Journal of Combinatorial Theory Series B
43
, 1987, pp. 140-150
A reduction procedure for coloring perfect
K_4
-free graphs
Alan Tucker
Journal of Combinatorial Theory Series B
43
, 1987, pp. 151-172
Oriented matroids from smooth manifolds
Douglas A. Miller
Journal of Combinatorial Theory Series B
43
, 1987, pp. 173-186
Matching structure and the matching lattice
László Lovász
Journal of Combinatorial Theory Series B
43
, 1987, pp. 187-222