13
Views
1
CrossRef citations to date
0
Altmetric
Articles

List edge and list total coloring of planar graphs without intersecting 8-cycles

&
Pages 925-934 | Received 01 Feb 2018, Published online: 21 Apr 2020

References

  • Borodin, O.V., Kostochka, A.V., Woodall, D.R. List edge and list total colourings of multigraphs. J. Comb. Theory Ser. B, 71: 184-204 (1997) doi: 10.1006/jctb.1997.1780
  • Bollobás, B., Harris, A.J. List-colourings of graphs. Graph Comb., 1: 115-127 (1985) doi: 10.1007/BF02582936
  • Chang, G.J., Hou, J., Roussel, N. On the total choosability of planar graphs and of sparse graphs. Inf Process Lett., 110: 849-853 (2010) doi: 10.1016/j.ipl.2010.07.007
  • Galvin, F. The list chromatic index of a bipartite multigraph. J. Comb. Theory Ser. B. 63: 153-158 (1995) doi: 10.1006/jctb.1995.1011
  • Häggkvist, R., Chetwynd, A. Some upper bounds on the total and list chromatic numbers of multi graphs. J. Graph Theory, 16: 503-516 (1992) doi: 10.1002/jgt.3190160510
  • Häggkvist, R., Janssen, J. New bounds on the list-chromatic index of the complete graph and other simple graphs. Comb. Probab. Com- put., 6: 295-313 (1997) doi: 10.1017/S0963548397002927
  • Hou, J.F., Liu, G.Z., Cai, J.S. List edge and list total colorings of planar graphs without 4-cycles. Theor Comput Sci., 369: 250-255 (2006) doi: 10.1016/j.tcs.2006.08.043
  • Li, R., Xu, B.G. Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles. Discret Math., 311: 2158- 2163 (2011) doi: 10.1016/j.disc.2011.06.031
  • Liu, B., Hou, J.F.,Wu, J.L., Liu G.Z. Total colorings and list total col- orings of planar graphs without intersecting 4-cycles. Discret Math., 309: 6035-6043 (2009) doi: 10.1016/j.disc.2009.05.006
  • Wang, H.J., Wu, L.D., Zhang, X., Wu, W.L., Liu, B. A note on the minimum number of choosability of planar graphs. J Comb Optim., doi:10.1007/s10878-014-9805-2 (2014)
  • Wang, H.J., Liu, B., Zhang, X., Wu, L.D., Wu, W., Gao, H. List edge and list total coloring of planar graphs with maximum degree 8. J Comb Optim., 32: 188-197 (2016) doi: 10.1007/s10878-015-9870-1
  • Wang, H.Y., Wu, J.l. List-edge-coloring of planar graphs without 6-cycles with three chords. J Comb Optim., 35: 555-562 (2018) doi: 10.1007/s10878-017-0193-2
  • Wang, W.F, Lih, K.W. Choosability, edge choosability and total choo- sability of outerplanar graphs. Eur. J. Comb., 22: 71-78 (2001) doi: 10.1006/eujc.2000.0430
  • Woodall, D.R. Edge-choosability of multicircuits. Discret. Math., 202: 271-277 (1999) doi: 10.1016/S0012-365X(98)00297-0
  • Wu, J.L., Wang, P. List-edge and list-total colorings of graphs embed- ded on hyperbolic surfaces. Discrete Math., 308: 6210-6215 (2008) doi: 10.1016/j.disc.2007.11.044

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:

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:

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.