IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v38y2019i1d10.1007_s10878-018-00376-9.html
   My bibliography  Save this article

Optimal channel assignment with list-edge coloring

Author

Listed:
  • Huijuan Wang

    (Qingdao University)

  • Panos M. Pardalos

    (University of Florida)

  • Bin Liu

    (Ocean University of China)

Abstract

Motivated from optimal channel assignment in optical networks, the list edge (and total) coloring are studied in this paper. In a special case of planar graphs, we determined the list edge (and total) coloring number.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:jcomop:v:38:y:2019:i:1:d:10.1007_s10878-018-00376-9
    DOI: 10.1007/s10878-018-00376-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-018-00376-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-018-00376-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Yishuo Shi & Yaping Zhang & Zhao Zhang & Weili Wu, 2016. "A greedy algorithm for the minimum $$2$$ 2 -connected $$m$$ m -fold dominating set problem," Journal of Combinatorial Optimization, Springer, vol. 31(1), pages 136-151, January.
    2. 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.
    3. 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.
    4. S. Bessy & F. Havet, 2013. "Enumerating the edge-colourings and total colourings of a regular graph," Journal of Combinatorial Optimization, Springer, vol. 25(4), pages 523-535, May.
    Full references (including those not matched with items on IDEAS)

    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.
    1. 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.
    2. Zhao Zhang & Jiao Zhou & Shaojie Tang & Xiaohui Huang & Ding-Zhu Du, 2018. "Computing Minimum k -Connected m -Fold Dominating Set in General Graphs," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 217-224, May.
    3. Yaoyao Zhang & Zhao Zhang & Ding-Zhu Du, 2023. "Construction of minimum edge-fault tolerant connected dominating set in a general graph," Journal of Combinatorial Optimization, Springer, vol. 45(2), pages 1-12, March.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Huijuan Wang & Bin Liu & Xin Zhang & Lidong Wu & Weili Wu & Hongwei Gao, 2016. "List edge and list total coloring of planar graphs with maximum degree 8," Journal of Combinatorial Optimization, Springer, vol. 32(1), pages 188-197, July.
    9. Xiaozhi Wang & Xianyue Li & Bo Hou & Wen Liu & Lidong Wu & Suogang Gao, 2021. "A greedy algorithm for the fault-tolerant outer-connected dominating set problem," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 118-127, January.
    10. Jiao Zhou & Zhao Zhang & Shaojie Tang & Xiaohui Huang & Ding-Zhu Du, 2018. "Breaking the O (ln n ) Barrier: An Enhanced Approximation Algorithm for Fault-Tolerant Minimum Weight Connected Dominating Set," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 225-235, May.
    11. 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.
    12. Yanhong Gao & Ping Li & Xueliang Li, 2022. "Further results on the total monochromatic connectivity of graphs," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 603-616, August.
    13. 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.

    Corrections

    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:38:y:2019:i:1:d:10.1007_s10878-018-00376-9. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.