@article{dmtcs:2159,
    title      = {On the complexity of edge-colored subgraph partitioning problems in network optimization},
    author     = {Xiaoyan Zhang and Zan-Bo Zhang and Hajo Broersma and Xuelian Wen},
    url        = {https://dmtcs.episciences.org/2159},
    doi        = {10.46298/dmtcs.2159},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {Vol. 17 no. 3},
    issuetitle = {Discrete Algorithms},
    eid        = 16,
    year       = {2016},
    month      = {Jul},
    keywords   = {network optimization, monochromatic clique, multicolored cycle, partition, forbidden induced subgraphs, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]},
    language   = {English},
}