1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
The Complexity of the Evolution of Graph Labelings
Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra
We study the {\sc Graph Relabeling Problem}--given an undirected, connected, simple graph , two labelings and of , and label {\em flip} or {\em mutation} fun…
Vertex coloring acyclic digraphs and their corresponding hypergraphs
Geir Agnarsson, Agust Egilsson, Magnus Mar Halldorsson
We consider vertex coloring of an acyclic digraph $\Gdag$ in such a way that two vertices which have a common ancestor in $\Gdag$ receive distinct colors. Such colorings arise in a…
On multipartite posets
Geir Agnarsson
A poset is {\em -partite} if has a partition such that (1) each forms an antichain in , and (2) $x\p…
On Colorings of Squares of Outerplanar Graphs
Geir Agnarsson, Magnus Mar Halldorsson
We study vertex colorings of the square of an outerplanar graph . We find the optimal bound of the inductiveness, chromatic number and the clique number of as a func…