Destroying Multicolored Paths and Cycles in Edge-Colored Graphs
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs
About this item
Full title
Author / Creator
Publisher
Nancy: DMTCS
Journal title
Language
English
Formats
Publication information
Publisher
Nancy: DMTCS
Subjects
More information
Scope and Contents
Contents
We study the computational complexity of $c$-Colored $P_\ell$ Deletion and
$c$-Colored $C_\ell$ Deletion. In these problems, one is given a
$c$-edge-colored graph and wants to destroy all induced $c$-colored paths or
cycles, respectively, on $\ell$ vertices by deleting at most $k$ edges. Herein,
a path or cycle is $c$-colored if it cont...
Alternative Titles
Full title
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_doaj_primary_oai_doaj_org_article_17478f46c4a84884b34b26c202b7c761
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_doaj_primary_oai_doaj_org_article_17478f46c4a84884b34b26c202b7c761
Other Identifiers
ISSN
1365-8050
E-ISSN
1365-8050
DOI
10.46298/dmtcs.7636
