zbMATH — the first resource for mathematics

On connected list colorings of graphs. (English) Zbl 0997.05039
See the review of the Russian original [Diskretn. Anal. Issled. Oper., Ser. 1 6, No. 4, 36-43 (1999; Zbl 0931.05033)].
05C15 Coloring of graphs and hypergraphs
05C69 Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Full Text: DOI
[1] V.A. Emelichev, O.I. Mel’nikov, V.I. Sarvanov, R.I. Tyshkevich, Lectures on Graph Theory, Nauka, Moscow, 1990 (in Russian). · Zbl 0711.05002
[2] Erdös, P.; Rubin, A.L.; Taylor, H., Choosability in graphs, Congr. numer., 26, 125-157, (1980)
[3] O.P. Stecenko, On a type of edge coloring of a graph with assigned colors, Diskret. Mat. 9(4) (1997) 92-93 (in Russian).
[4] Tuza, Z., Graph colorings with local constraints – a survey, Discuss. math. graph theory, 17, 2, 161-228, (1997) · Zbl 0923.05027
[5] V.G. Vizing, Vertex coloring of a graph with assigned colors, Metody Diskret. Analiz. (Novosibirsk) 29 (1976) 3-10 (in Russian).
[6] A.A. Zykov, The Basics of Graph Theory, Nauka, Moscow, 1987 (in Russian). · Zbl 0645.05001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.