Advanced search

Browse by subject

Browse by provider

Browse by language

Content Details
Normal View
CIP View

On the game chromatic number of sparse r...

Frieze, Alan...

Free

Share this content

On the game chromatic number of sparse random graphs by Frieze, Alan ( Author )

Content Provider	Lemonjar Open Access
Publisher	Australian National University
Publication Date	07-07-2023
Summary	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 \chi_g(G) is the minimum k for which the first player has a winning strategy. The paper \cite{BFS} began the analysis of the asymptotic behavior of this parameter for a random graph G_{n,p}. This paper provides some further analysis for graphs with constant average degree i.e. np=O(1) and for random regular graphs.
ISBN	-
Item Type	Article
File Type	pdf
File Size	29.34 KB
Language	English
Subjects	-
Unlimited	MYR 0.01
Total read	-
URL	http://arxiv.org/abs/1201.0046

Citation

Review the full bibliography data and make any necessary corrections before using. Always consult your library resources for the exact formatting and punctuation guidelines.

AMA 11th EditionReferences

Frieze, Alan. On the game chromatic number of sparse random graphs. Australian National University. July 07, 2023. Accessed November 10, 2024. https://online.provdatabase.com/cite/5255

APA 7th EditionReferences

Frieze, Alan. (2023). On the game chromatic number of sparse random graphs. Australian National University. https://online.provdatabase.com/cite/5255

Chicago 17th EditionReferences

Frieze, Alan. On the game chromatic number of sparse random graphs. Australian National University. 2023. https://online.provdatabase.com/cite/5255

HarvardReferences

Frieze, Alan. (2023). On the game chromatic number of sparse random graphs. [Online]. Australian National University. Available from: https://online.provdatabase.com/cite/5255. (Accessed 10 November 2024).

Harvard AustraliaReferences

Frieze, Alan, 2023, On the game chromatic number of sparse random graphs, Australian National University, viewed 10 November 2024, <https://online.provdatabase.com/cite/5255>

MLA 9th EditionWorks Cited

Frieze, Alan. On the game chromatic number of sparse random graphs. Australian National University, 2023. PROV Database, https://online.provdatabase.com/cite/5255.

Share this eBook