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="MacGillivray, Gary"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Weak near-unanimity functions and digraph homomorphism problems
Gary MacGillivray
,
Jacobus Swarts
Theoretical Computer Science
477
, 2013, pp. 32-47
Injective oriented colourings
Gary MacGillivray
,
André Raspaud
,
Jacobus Swarts
Lecture Notes in Computer Science
5911
, 2010, pp. 262-272
Near-unanimity functions and varieties of reflexive graphs
Richard C. Brewster
,
Tomas Feder
,
Pavol Hell
,
Jing Huang
,
Gary MacGillivray
SIAM Journal on Discrete Mathematics
22
(3), 2008, pp. 938-960
Generalized partitions of graphs
Gary MacGillivray
,
Min-Li Yu
Discrete Applied Mathematics
91
(1-3), 1999, pp. 143-153
Homomorphically full graphs
Richard Brewster
,
Gary MacGillivray
Discrete Applied Mathematics
66
(1), 1996, pp. 23-31
Vertex domination-critical graphs
Jason Fulman
,
Denis Hanson
,
Gary MacGillivray
Networks
25
(2), 1995, pp. 41-43
A note on minimum graphs with girth pair
(4,2l + 1)
Denis Hanson
,
Ping Wang
,
Gary MacGillivray
Journal of Graph Theory
18
(4), 1994, pp. 325-327
Graph homomorphisms with infinite targets
Gary MacGillivray
Discrete Applied Mathematics
54
, 1994, pp. 29-35
A note on restricted
H
-colouring
Richard Brewster
,
Gary MacGillivray
Information Processing Letters
40
, 1991, pp. 149-151
On the complexity of colouring by vertex-transitive and arc-transitive digraphs
Gary MacGillivray
SIAM Journal on Discrete Mathematics
4
(3), 1991, August, pp. 397-408
A linear time algorithm for longest
(s, t)
-paths in weighted outerplanar graphs
John A. Ellis
,
Manrique Mata
,
Gary MacGillivray
Information Processing Letters
32
, 1989, pp. 199-204
The complexity of colouring by semicomplete digraphs
Jrgen Bang-Jensen
,
Pavol Hell
,
Gary MacGillivray
SIAM Journal on Discrete Mathematics
1
, 1988, pp. 281-298