We study the computational complexity of $c$-Colored $P_\ell$ Deletion and $C_\ell$ Deletion. In these problems, one is given a $c$-edge-colored graph wants to destroy all induced $c$-colored paths or cycles, respectively, on $\ell$ vertices by deleting at most $k$ edges. Herein, path cycle if it contains edges $c$ distinct colors. show that are NP-hard for each non-trivial combination $\ell$. ...

We deal with different algorithmic questions regarding properly arc-colored s-t paths, trails and circuits in arc-colored digraphs. Given an arc-colored digraph D with c ≥ 2 colors, we show that the problem of maximizing the number of arc disjoint properly arc-colored s-t trails can be solved in polynomial time. Surprisingly, we prove that the determination of one properly arc-colored s-t path ...

Recently, a type of GUT models with an extra dimension in AdS space can successfully solve the doublet-triplet problem, maintain proton stability, and allow the colored Higgs bosons and colored Higgsinos in the TeV mass region. We study the hadronic production and detection of these TeV colored Higgsinos and Higgs bosons. If the colored Higgsino is lighter than the colored Higgs boson, the colo...

purpose: to report a rare case of ciliochoroidal malignant melanoma presenting as a subconjunctival black-colored mass adjacent to the limbus. patient and findings: a 42-year-old woman presented with a subconjunctival black-colored mass adjacent to the limbus in left eye from 2 years ago. the lesion had increased in size during the previous 2 months. funduscopic examination with scleral depress...