Advanced search
Publication Cover
International Journal of Computer Mathematics: Computer Systems Theory Volume 6, 2021 - Issue 2
Submit an article Journal homepage
65
Views
0
CrossRef citations to date
0
Altmetric
Research Article

A note on improper DP-colouring of planar graphs

Hongyan Caia Department of Mathematics, School of Mathematics and Statistics, Guizhou University, Guiyang, People's Republic of ChinaView further author information
&
Qiang Sunb School of Mathematical Science, Yangzhou University, Yangzhou, People's Republic of ChinaCorrespondence[email protected]
ORCID Iconhttps://orcid.org/0000-0002-8990-9610View further author information
ORCID Icon
Pages 159-166 | Received 27 Aug 2020, Accepted 30 Dec 2020, Published online: 20 Jan 2021

References

  • J.A. Bondy and U.S.R.L. Murty. Graph Theory, Graduate Texts in mathematics, Vol. 244, Springer, New York, 2008.
  • M. Chen and A. Raspaud, On (3,1)∗-choosability of planar graphs without adjacent short cycles, Discrete Appl. Math. 165 (2014), pp. 159–166.
  • M. Chen, A. Raspaud, and W. Wang, A (3,1)∗-choosable theorem on planar graphs, J. Comp. Optim. 32 (2016), pp. 927–940.
  • L. Cowen, R. Cowen, and D. Woodall, Defective colorings of graphs in surface: partitions into subgraphs of bounded valency, J. Graph Theory 10 (1986), pp. 187–195.
  • W. Cushing and H.A. Kierstead, Planar graphs are (4,1)∗-choosable, Eur. J. Combin. 31 (2009), pp. 1385–1397.
  • W. Dong and B. gang, A note on list improper coloring plane graphs, Discrete Appl. Math. 157 (2009), pp. 433–436.
  • Z. Dvořák and L. Postle, Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8, J. Comb. Theory Ser. B. 129 (2018), pp. 38–54.
  • S-J. Kim, R. Liu, and G. Yu, Planar graphs without 7-cycles and butterfiles are DP-4-colorable, Discrete Math. 343 (2020), pp. 111714.
  • S-J. Kim and K. Ozeki, A sufficient condition for DP-4-colorability, Discrete Math. 341 (2018), pp. 1983–1986.
  • S-J. Kim and X. Yu, Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable, Graph and Combinatorics 35 (2019), pp. 707–718.
  • K. Lih, Z. Song, W. Wang, and K. Zhang, A note on list improper coloring planar graphs, Appl. Math. Lett. 14 (2001), pp. 269–273.
  • R. Liu and X. Li, Every planar graphs without 4-cycles adjacent to two triangles are DP-4-colorable, Discrete Math. 342 (2019), pp. 623–627.
  • R. Liu, S. Loeb, M. Rolek, Y. Yin, and G. Yu, DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from {6,7,8}, Graphs and Combin. 35 (2019), pp. 695–705.
  • R. Liu, S. Loeb, Y. Yin, and G. Yu, DP-3-coloring of some planar graphs, Discrete Math. 342 (2019), pp. 178–189.
  • M. Rao and T. Wang. DP-3-coloring of planar graphs without certain cycles, preprint (2020) Available at arXiv:2001.00298.
  • P. Sittitrai and K. Nakprasit, Sufficient conditions on planar graphs to have a relaxed DP-3-colorability, Graphs and Combinatorics 35 (2019), pp. 837–845.
  • B. Xu and H. Zhang, Every torodial graph without adjacent triangles is (4,1)∗-choosable, Discrete Appl. Math. 155 (2007), pp. 74–78.
  • L. Zhang, A (3,1)∗-choosable theorem on toroidal graphs, Discrete Appl. Math. 160 (2012), pp. 332–338.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.