Zobrazeno 1 - 10
of 133
pro vyhledávání: '"FARIA, LUERBIO"'
Publikováno v:
In Discrete Optimization February 2025 55
Results about the total chromatic number and the conformability of some families of circulant graphs
Publikováno v:
In Discrete Applied Mathematics 15 December 2023 340:123-133
Autor:
Alves, Sancrey R., Couto, Fernanda, Faria, Luerbio, Gravier, Sylvain, Klein, Sulamita, Souza, Uéverton S.
Publikováno v:
In Discrete Mathematics March 2023 346(3)
The input of the Maximum Colored Cut problem consists of a graph $G=(V,E)$ with an edge-coloring $c:E\to \{1,2,3,\ldots , p\}$ and a positive integer $k$, and the question is whether $G$ has a nontrivial edge cut using at least $k$ colors. The Colorf
Externí odkaz:
http://arxiv.org/abs/1805.00858
Autor:
Faria, Luerbio, Souza, Uéverton S.
Publikováno v:
In Theoretical Computer Science 6 October 2022 932:56-68
Autor:
Alves, Sancrey R., Dabrowski, Konrad K., Faria, Luerbio, Klein, Sulamita, Sau, Ignasi, Souza, Uéverton S.
An $(r, \ell)$-partition of a graph $G$ is a partition of its vertex set into $r$ independent sets and $\ell$ cliques. A graph is $(r, \ell)$ if it admits an $(r, \ell)$-partition. A graph is well-covered if every maximal independent set is also maxi
Externí odkaz:
http://arxiv.org/abs/1705.09177
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol. 19 no. 1, Discrete Algorithms (June 7, 2017) dmtcs:1540
A graph $G$ is signed if each edge is assigned $+$ or $-$. A signed graph is balanced if there is a bipartition of its vertex set such that an edge has sign $-$ if and only if its endpoints are in different parts. The Edwards-Erd\"os bound states tha
Externí odkaz:
http://arxiv.org/abs/1512.05223
For two integers $r, \ell \geq 0$, a graph $G = (V, E)$ is an $(r,\ell)$-graph if $V$ can be partitioned into $r$ independent sets and $\ell$ cliques. In the parameterized $(r,\ell)$-Vertex Deletion problem, given a graph $G$ and an integer $k$, one
Externí odkaz:
http://arxiv.org/abs/1504.05515
Publikováno v:
In Procedia Computer Science 2021 195:212-220
Publikováno v:
In Discrete Applied Mathematics 15 July 2020 281:118-133