5 papers
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…
Graph Ramsey games
Wolfgang Slany
We consider combinatorial avoidance and achievement games based on graph Ramsey theory: The players take turns in coloring still uncolored edges of a graph G, each player being ass…
A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning
Andreas Raggl, Wolfgang Slany
Real world combinatorial optimization problems such as scheduling are typically too complex to solve with exact methods. Additionally, the problems often have to observe vaguely sp…