The connected greedy coloring game

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 2023 English Publisher:Elsevier BVJournal:Theoretical Computer Science, volume 940, pages 1-13 (issn: 0304-3975,

Copyright policy )

Authors: Carlos V. G. C. Lima; Thiago Marcilon; Nicolas Almeida Martins; Rudini Menezes Sampaio;

doi: 10.1016/j.tcs.2022.10.034

The connected greedy coloring game

- Summary
- Subjects
- Metrics

Abstract

zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Organizations

Keywords

Games on graphs (graph-theoretic aspects), game chromatic number, PSPACE-hardness, game Grundy number, greedy coloring game, Coloring of graphs and hypergraphs, graph coloring game, Graph theory (including graph drawing) in computer science, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), connected coloring game

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	7
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%