Journal of Applied Mathematics and Computing

, Volume 36, Issue 1, pp 367–372

A note on edge-choosability of planar graphs without intersecting 4-cycles

Authors

  • Qiaoling Ma
    • School of ScienceUniversity of Jinan
    • School of ScienceUniversity of Jinan
  • Jiansheng Cai
    • School of Mathematics and Information ScienceWeifang University
  • Sumei Zhang
    • School of ScienceUniversity of Jinan
Article

DOI: 10.1007/s12190-010-0408-5

Cite this article as:
Ma, Q., Wang, J., Cai, J. et al. J. Appl. Math. Comput. (2011) 36: 367. doi:10.1007/s12190-010-0408-5
  • 51 Views

Abstract

A graph G is edge-L-colorable, if for a given edge assignment L={L(e):eE(G)}, there exits a proper edge-coloring φ of G such that φ(e)∈L(e) for all eE(G). If G is edge-L-colorable for every edge assignment L with |L(e)|≥k for eE(G), then G is said to be edge-k-choosable. In this paper, We investigate structural of planar graphs without intersecting 4-cycles and show that every planar graph without intersecting 4-cycles is edge-k-choosable, where \(k=\max\{7,\Delta(G)+1\}\).

Keywords

Planar graphEdge-coloringChoosabilityCycleChordCombinatorial problem

Mathematics Subject Classification (2000)

05C15

Copyright information

© Korean Society for Computational and Applied Mathematics 2010