• Corpus ID: 4669422

Playing cards with Vizing's demon

@inproceedings{Rabern2012PlayingCW,
  title={Playing cards with Vizing's demon},
  author={Brian Rabern and Landon Rabern},
  year={2012}
}
We analyze a solitaire game in which a demon rearranges some cards after each move. The graph edge coloring theorems of Kőnig (1931) and Vizing (1964) follow from the winning strategies developed. 

Figures and Tables from this paper

References

SHOWING 1-9 OF 9 REFERENCES
A game generalizing Hall's Theorem
A new method of proving theorems on chromatic index
Combinatorial optimization. Polyhedra and efficiency.
TLDR
This book shows the combinatorial optimization polyhedra and efficiency as your friend in spending the time in reading a book.
On Representatives of Subsets
Let a set S of mn things be divided into m classes of n things each in two distinct ways, (a) and (b); so that there are m (a)-classes and m (b)-classes. Then it is always possible to find a set R of
Gráfok és mátrixok
  • Matematikai és Fizikai Lapok
  • 1931
Favrholdt, Graph Edge Coloring: Vizing’s
  • Theorem and Goldberg’s Conjecture,
  • 2012
Gráfok és mátrixok , Matematikai és Fizikai Lapok
    On an estimate of the chromatic class of a p-graph
    • Diskret. Analiz
    • 1964