(4, 2)-Choosability of Planar Graphs with Forbidden Structures-Reference-Cited by-同舟云学术

(4, 2)-Choosability of Planar Graphs with Forbidden Structures

Published:2017-06-14 Issue:4 Volume:33 Page:751-787
ISSN:0911-0119
Container-title:Graphs and Combinatorics
language:en
Short-container-title:Graphs and Combinatorics

Author:

Berikkyzy Zhanar,Cox Christopher,Dairyko Michael,Hogenson Kirsten,Kumbhat Mohit,Lidický Bernard^ORCID,Messerschmidt Kacy,Moss Kevin,Nowak Kathleen,Palmowski Kevin F.,Stolee Derrick

Funder

National Science Foundation

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Link

http://link.springer.com/article/10.1007/s00373-017-1812-5/fulltext.html

Reference15 articles.

1. Alon, N., Tarsi, M.: Colorings and Orientations of Graphs. Combinatorica 12(2), 125–134 (1992). doi: 10.1007/BF01204715

2. Borodin, O.V.: Colorings of Plane Graphs: A Survey. Discret. Math. 313(4), 517–539 (2013). doi: 10.1016/j.disc.2012.11.011

3. Borodin, O.V., Ivanova, A.O.: Planar Graphs Without Triangular 4-Cycles are 4-Choosable. Sib. Élektron. Mat. Izv. 5, 75–79 (2008)

4. Choi, I., Lidický, B., Stolee, D.: On Choosability with Separation of Planar Graphs with Forbidden Cycles. J. Graph Theory 81(3), 283–306 (2016). doi: 10.1002/jgt.21875

5. Cranston, D.W., West, D.B.: An Introduction to the Discharging Method via Graph Coloring. Discret. Math. 340(4), 766–793 (2017). doi: 10.1016/j.disc.2016.11.022

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

1. List 4-colouring of planar graphs;Journal of Combinatorial Theory, Series B;2023-09

2. Choosability with separation of cycles and outerplanar graphs;Discussiones Mathematicae Graph Theory;2021

3. On the (3,1)-choosability of planar graphs without adjacent cycles of length 5,6,7;Discrete Mathematics;2019-06