On Balanced Coloring Games in Random Graphs

Gugelmann, Luca; Spöhel, Reto

doi:10.1016/j.endm.2011.09.069

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

On Balanced Coloring Games in Random Graphs

MPS-Authors

/persons/resource/persons45534

Spöhel, Reto
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Gugelmann, L., & Spöhel, R. (2011). On Balanced Coloring Games in Random Graphs. In J. Nešetřil, E. Győri, & A. Sali (Eds.), The Sixth European Conference on Combinatorics, Graph Theory and Applications (pp. 425-430). Amsterdam: Elsevier. doi:10.1016/j.endm.2011.09.069.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0010-1262-B

Abstract

There is no abstract available