Online $$\boldsymbol{L(2,1)}$$-Coloring Problem on Paths with Restricted Size of Memory
-
Published:2023-02
Issue:2
Volume:44
Page:680-686
-
ISSN:1995-0802
-
Container-title:Lobachevskii Journal of Mathematics
-
language:en
-
Short-container-title:Lobachevskii J Math
Publisher
Pleiades Publishing Ltd
Subject
General Mathematics
Reference18 articles.
1. M. P. Bianchi, H.-J. Böckenhauer, J. Hromkovič, S. Krug, and B. Steffen, ‘‘On the advice complexity of the online l (2, 1)-coloring problem on paths and cycles,’’ Theor. Comput. Sci. 554, 22–39 (2014).
2. Frequency assignment problems;R. Murphey,1999
3. J. R. Griggs and R. K. Yeh, ‘‘Labelling graphs with a condition at distance 2,’’ SIAM J. Discrete Math. 5, 586–595 (1992).
4. H. Broersma, ‘‘A general framework for coloring problems: Old results, new results, and open problems,’’ in Proceedings of the Indonesia–Japan Joint Conference on Combinatorial Geometry and Graph Theory (Springer, 2003), pp. 65–79.
5. R. K. Yeh, ‘‘A survey on labeling graphs with a condition at distance two,’’ Discrete Math. 306, 1217–1231 (2006).