×

zbMATH — the first resource for mathematics

On acyclic colorings of planar graphs. (English) Zbl 0406.05031

MSC:
05C15 Coloring of graphs and hypergraphs
05C10 Planar graphs; geometric and topological aspects of graph theory
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Albertson, M.O.; Berman, D.M., Every planar graph has an acyclic 7-coloring, Israel J. math., 28, 169-174, (1977) · Zbl 0374.05022
[2] Borodin, O.V., On decomposition of graphs into degenerated subgraphs, Discretny analys, 28, 3-12, (1976), (in Russian) · Zbl 0425.05058
[3] Chartrand, G.; Kronk, H.V., The point arboricity of planar graphs, J. London math. soc., 44, 612-616, (1968) · Zbl 0175.50505
[4] Chartrand, G.; Geller, D.P.; Hedetniemi, S., Graphs with forbidden subgraphs, J. combin. theory, 10, 12-41, (1971) · Zbl 0223.05101
[5] Grünbaum, B., Acyclic colorings of planar graphs, Israel J. math., 14, 390-412, (1973) · Zbl 0265.05103
[6] Hedetniemi, S., On partitioning planar graphs, Can. math. bull., 11, 203-211, (1968) · Zbl 0167.21805
[7] Kostochka, A.V., Acyclic 6-coloring of planar graphs, Discretny analys, 28, 40-56, (1976), (in Russian) · Zbl 0412.05043
[8] Kostochka, A.V.; Melnikov, L.S., To the paper of B. grünbaum on acyclic colorings, Discrete math., 14, 403-406, (1976) · Zbl 0318.05103
[9] Lick, D.R.; White, A.T., The point partition numbers of closed 2-manifolds, J. London math. soc., 1, 2, 750-752, (1969)
[10] Mitchem, J., Every planar graph has an acyclic 8-coloring, Duke math. J., 41, 177-181, (1974) · Zbl 0284.05103
[11] Stein, S.K., B-sets and coloring problems, Bull. am. math. soc., 76, 805-806, (1970) · Zbl 0194.56004
[12] Wegner, G., On the paper of B. grünbaum on acyclic colorings, Israel J. math., 14, 409-412, (1973) · Zbl 0265.05104
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.