1999 Reviewers List

In the List H- Homomorphism Problem, for a graph H that is a parameter of the problem, an instance consists of an undirected graph G with a list constraint $${L(v) \subseteq V(H)}$$L(v)⊆V(H) for each variable $${v \in V(G)}$$vźV(G), and the objective is ...

This paper exploits the remarkable new method of Galvin (J. Combin. Theory Ser. B63(1995), 153 158), who proved that the list edge chromatic number list(G) of a bipartite multigraphGequals its edge chromatic number (G). It is now proved here that if ...

In (3) Perlis and Thornton describe a list structure language the central innovation of which is that the last word of each list specifies the location of the head of the list of which it is the terminal word. They call such list structures threaded ...