Acyclic 4-coloring of planar graphs without 4- and 5-cycles-Reference-Cited by-同舟云学术

Acyclic 4-coloring of planar graphs without 4- and 5-cycles

Published:2011-01 Issue:1 Volume:5 Page:31-43
ISSN:1990-4789
Container-title:Journal of Applied and Industrial Mathematics
language:en
Short-container-title:J. Appl. Ind. Math.

Author:

Borodin O. V.

Publisher

Pleiades Publishing Ltd

Subject

Applied Mathematics,Industrial and Manufacturing Engineering

Link

http://link.springer.com/content/pdf/10.1134/S1990478911010042.pdf

Reference23 articles.

1. O. V. Borodin, “A Proof of Grunbaum’s Conjecture on the Acyclic 5-Colorability of Planar Graphs,” Dokl. Akad. Nauk SSSR 231, 18–20 (1976) [Sov.Math. Dokl. 17(1976), 1499–1502 (1977)].

2. O. V. Borodin, “Acyclic 3-Choosability of Planar Graphs without Cycles of Length from 4 to 12,” Diskretn. Anal. Issled. Oper. 16(5), 26–33 (2009) [J. Appl. Indust. Math. 4 (2), 158–162 (2010)].

3. O. V. Borodin, “Acyclic 4-Colorability of Planar Graphs without Cycles of Length 4 or 6,” Diskretn. Anal. Issled. Oper. 16(6), 3–11 (2009) [J. Appl. Indust. Math. 4 (4), 490–495 (2010)].

4. A. V. Kostochka, “Acyclic 6-Coloring of Planar Graphs,” Diskret. Analiz 28, 40–56 (1976).

5. H. L. Abbott and B. Zhou, “On Small Faces in 4-Critical Graphs,” Ars Comb. 32, 203–207 (1991).

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On acyclically 4-colorable maximal planar graphs;Applied Mathematics and Computation;2018-07

2. Construction of acyclically 4-colourable planar triangulations with minimum degree 4;International Journal of Computer Mathematics;2018-05-31

3. Acyclically 4-colorable triangulations;Information Processing Letters;2016-06