Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Caroline Aparecida de Paula Silva"'
Publikováno v:
Discrete Mathematics. 346:113458
Let $D$ be a digraph. A stable set $S$ of $D$ and a path partition $\mathcal{P}$ of $D$ are orthogonal if every path $P \in \mathcal{P}$ contains exactly one vertex of $S$. In 1982, Berge defined the class of $α$-diperfect digraphs. A digraph $D$ is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::127f4f1950d2b6f13583abcf56f4446f
https://doi.org/10.1016/j.disc.2023.113458
https://doi.org/10.1016/j.disc.2023.113458
Publikováno v:
LATIN 2022: Theoretical Informatics ISBN: 9783031206238
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1543da3e7498c31010a8f5e65d581b6
https://doi.org/10.1007/978-3-031-20624-5_28
https://doi.org/10.1007/978-3-031-20624-5_28
Publikováno v:
Discrete Mathematics. 345:112941
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6efdd82a84be7b21318b5be34d64aa6e
https://doi.org/10.1016/j.disc.2022.112941
https://doi.org/10.1016/j.disc.2022.112941
Publikováno v:
Revista Eletrônica de Iniciação Científica em Computação; v. 18, n. 3 (2020): Edição Especial: Artigos do 39º Concurso de Trabalhos de Iniciação Científica (CSBC/CTIC)
Given a (vertex)-coloring $\mathcal{C} = \{C_{1}, C_{2}, ... C_{m}\}$ of a digraph $D$ and a positive integer $k$, the $k$-norm of $\mathcal{C}$ is defined as $ |\mathcal{C}|_k = \sum_{i = 1}^{m} min\{|C_i|, k\}.$ A coloring $\mathcal{C}$ is $k$-opti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::289f25a24c4ce4be22367f6c27ebf9c5
https://seer.ufrgs.br/reic/article/view/106248
https://seer.ufrgs.br/reic/article/view/106248