16 citations · 16 across the 4 of their papers we have counts for
4 papers
Lune -- Free Knot Graphs
Shalom Eliahou, Frank Harary, Louis H. Kauffman
This paper is an exploration of simple four-regular graphs in the plane (i.e. loopless and with no more than one edge between any two nodes). Such graphs are fundamental to the the…
On the Computational Complexity of the Forcing Chromatic Number
Frank Harary, Wolfgang Slany, Oleg Verbitsky
We consider vertex colorings of graphs in which adjacent vertices have distinct colors. A graph is -chromatic if it is colorable in colors and any coloring of it uses at lea…
On the Lengths of Symmetry Breaking-Preserving Games on Graphs
Frank Harary, Wolfgang Slany, Oleg Verbitsky
Given a graph , we consider a game where two players, and , alternatingly color edges of in red and in blue respectively. Let be the maximum number of moves in…
A Symmetric Strategy in Graph Avoidance Games
Frank Harary, Wolfgang Slany, Oleg Verbitsky
In the graph avoidance game two players alternatingly color edges of a graph G in red and in blue respectively. The player who first creates a monochromatic subgraph isomorphic to…