List edge and list total coloring of planar graphs with maximum degree 8
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-015-9870-1
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
- Xiangwen Li & Vicky Mak-Hau & Sanming Zhou, 2013. "The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups," Journal of Combinatorial Optimization, Springer, vol. 25(4), pages 716-736, May.
- Huijuan Wang & Lidong Wu & Weili Wu & Jianliang Wu, 2014. "Minimum number of disjoint linear forests covering a planar graph," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 274-287, July.
- Huijuan Wang & Lidong Wu & Weili Wu & Panos Pardalos & Jianliang Wu, 2014. "Minimum total coloring of planar graph," Journal of Global Optimization, Springer, vol. 60(4), pages 777-791, December.
- Patrizio Angelini & Fabrizio Frati, 2012. "Acyclically 3-colorable planar graphs," Journal of Combinatorial Optimization, Springer, vol. 24(2), pages 116-130, August.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Qiufen Ni & Smita Ghosh & Chuanhe Huang & Weili Wu & Rong Jin, 2021. "Discount allocation for cost minimization in online social networks," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 213-233, January.
- Cai, Jiansheng & Li, Wenwen & Cai, Wenjing & Dehmer, Matthias, 2023. "List injective coloring of planar graphs," Applied Mathematics and Computation, Elsevier, vol. 439(C).
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.- Huijuan Wang & Lidong Wu & Weili Wu & Jianliang Wu, 2014. "Minimum number of disjoint linear forests covering a planar graph," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 274-287, July.
- Huijuan Wang & Lidong Wu & Xin Zhang & Weili Wu & Bin Liu, 2016. "A note on the minimum number of choosability of planar graphs," Journal of Combinatorial Optimization, Springer, vol. 31(3), pages 1013-1022, April.
- Enqiang Zhu & Zepeng Li & Zehui Shao & Jin Xu & Chanjuan Liu, 2016. "Acyclic 3-coloring of generalized Petersen graphs," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 902-911, February.
- Lin Sun & Jian-Liang Wu, 2017. "On (p, 1)-total labelling of planar graphs," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 317-325, January.
- Zehui Shao & Jin Xu & Roger K. Yeh, 2016. "$$L(2,1)$$ L ( 2 , 1 ) -labeling for brick product graphs," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 447-462, February.
- Huijuan Wang & Bin Liu & Xiaoli Wang & Guangmo Tong & Weili Wu & Hongwei Gao, 2017. "Total coloring of planar graphs without adjacent chordal 6-cycles," Journal of Combinatorial Optimization, Springer, vol. 34(1), pages 257-265, July.
- Huijuan Wang & Panos M. Pardalos & Bin Liu, 2019. "Optimal channel assignment with list-edge coloring," Journal of Combinatorial Optimization, Springer, vol. 38(1), pages 197-207, July.
- Hua Cai & Jianliang Wu & Lin Sun, 2016. "Total coloring of planar graphs without short cycles," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1650-1664, May.
- Huijuan Wang & Bin Liu & Yan Gu & Xin Zhang & Weili Wu & Hongwei Gao, 2017. "Total coloring of planar graphs without adjacent short cycles," Journal of Combinatorial Optimization, Springer, vol. 33(1), pages 265-274, January.
- Huijuan Wang & Bin Liu & Ling Gai & Hongwei Du & Jianliang Wu, 2018. "Minimum choosability of planar graphs," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 13-22, July.
More about this item
Keywords
Choosability; Planar graph; List edge coloring; List total coloring;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:spr:jcomop:v:32:y:2016:i:1:d:10.1007_s10878-015-9870-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.