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: Author="Bauslaugh, Bruce"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
List-compactness of infinite directed graphs
Bruce L. Bauslaugh
Graphs and Combinatorics
17
(1), 2001, pp. 17-38
Tearing a strip off the plane
Bruce L. Bauslaugh
Journal of Graph Theory
29
(1), 1998, pp. 17-33
Cores and compactness of infinite directed graphs
Bruce L. Bauslaugh
Journal of Combinatorial Theory Series B
68
(2), 1996, pp. 255-276
The complexity of infinite
H
-colouring
Bruce Bauslaugh
Journal of Combinatorial Theory Series B
61
(2), 1994, pp. 141-154
The complexity of colouring by infinite vertex transitive graphs
Bruce Bauslaugh
Quo vadis, graph theory? A source book for challenges and directions
Annals of Discrete Mathematics 55
, 1993, pp. 71-79