A sufficient condition for planar graphs with girth 5 to be (1,6)-colorable
Author
Abstract
Suggested Citation
DOI: 10.1016/j.amc.2024.128706
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Wang, Yang & Huang, Danjun & Finbow, Stephen, 2020. "On the vertex partition of planar graphs into forests with bounded degree," Applied Mathematics and Computation, Elsevier, vol. 374(C).
- Miao Zhang & Min Chen & Yiqiao Wang, 2017. "A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 847-865, April.
- Tingting Wu & Jiangxu Kong & Weifan Wang, 2016. "The 2-surviving rate of planar graphs without 5-cycles," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1479-1492, May.
- Lingji Xu & Zhengke Miao & Yingqian Wang, 2014. "Every planar graph with cycles of length neither 4 nor 5 is $$(1,1,0)$$ -colorable," Journal of Combinatorial Optimization, Springer, vol. 28(4), pages 774-786, November.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Hou, Jianfeng & Jin, Yindong & Li, Heng & Miao, Lianying & Zhao, Qian, 2023. "On L(p,q)-labelling of planar graphs without cycles of length four," Applied Mathematics and Computation, Elsevier, vol. 446(C).
- Hou, Jianfeng & Zhu, Hongguo, 2020. "Choosability with union separation of planar graphs without cycles of length 4," Applied Mathematics and Computation, Elsevier, vol. 386(C).
- Miao Zhang & Min Chen & Yiqiao Wang, 2017. "A sufficient condition for planar graphs with girth 5 to be (1, 7)-colorable," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 847-865, April.
- Weifan Wang & Tingting Wu & Xiaoxue Hu & Yiqiao Wang, 2018. "Planar graphs without chordal 5-cycles are 2-good," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 980-996, April.
More about this item
Keywords
Improper coloring; Planar graphs; Cycle; Discharging method;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:474:y:2024:i:c:s0096300324001784. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.