#### Filter Results:

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Given a graph G and an integer k, two players take turns coloring the vertices of G one by one using k colors so that neighboring vertices get different colors. The first player wins iff at the end of the game all the vertices of G are colored. The game chromatic number χ g (G) is the minimum k for which the first player has a winning strategy. The paper… (More)

- T Aaltonen, B A Gonzalez, S Amerio, D Amidei, A Anastassov, A Annovi +494 others
- 2013

Observation of B-s(0)-> J/psi K*(892)(0) and B-s(0)-> J/psi K-S(0) decays

- ‹
- 1
- ›