Showing cs.CCShow all
2 papers · 1 filter
cs.CC2004
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…
cs.CC1999
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…