Zobrazeno 1 - 10
of 39
pro vyhledávání: '"Sambinelli, Maycon"'
Autor:
Jiménez, Andrea, Knauer, Kolja, Lintzmayer, Carla Negri, Matamala, Martín, Peña, Juan Pablo, Quiroz, Daniel A., Sambinelli, Maycon, Wakabayashi, Yoshiko, Yu, Weiqiang, Zamora, José
The proper conflict-free chromatic number, $\chi_{pcf}(G)$, of a graph $G$ is the least $k$ such that $G$ has a proper $k$-coloring in which for each non-isolated vertex there is a color appearing exactly once among its neighbors. The proper odd chro
Externí odkaz:
http://arxiv.org/abs/2308.00170
Autor:
Botler, Fábio, Jiménez, Andrea, Lintzmayer, Carla N., Pastine, Adrián, Quiroz, Daniel A., Sambinelli, Maycon
Publikováno v:
European Journal of Combinatorics, Volume 122, Article 104042, 2024
The analogue of Hadwiger's conjecture for the immersion relation states that every graph $G$ contains an immersion of $K_{\chi(G)}$. For graphs with independence number 2, this is equivalent to stating that every such $n$-vertex graph contains an imm
Externí odkaz:
http://arxiv.org/abs/2303.06483
Autor:
Botler, Fabio, Sambinelli, Maycon
A path decomposition of a graph G is a collection of edge-disjoint paths of G that covers the edge set of G. Gallai (1968) conjectured that every connected graph on n vertices admits a path decomposition of cardinality at most (n+1)/2. Seminal result
Externí odkaz:
http://arxiv.org/abs/1911.04546
Let $D$ be a digraph. Given a set of vertices $S \subseteq V(D)$, an $S$-path partition $\mathcal{P}$ of $D$ is a collection of paths of $D$ such that $\{V(P) \colon P \in \mathcal{P}\}$ is a partition of $V(D)$ and $|V(P) \cap S| = 1$ for every $P \
Externí odkaz:
http://arxiv.org/abs/1904.02799
A graph is locally irregular if any pair of adjacent vertices have distinct degrees. A locally irregular decomposition of a graph $G$ is a decomposition $\mathcal{D}$ of $G$ such that every subgraph $H \in \mathcal{D}$ is locally irregular. A graph i
Externí odkaz:
http://arxiv.org/abs/1902.00986
A path decomposition of a graph $G$ is a collection of edge-disjoint paths of $G$ that covers the edge set of $G$. Gallai (1968) conjectured that every connected graph on $n$ vertices admits a path decomposition of cardinality at most $\lfloor (n+1)/
Externí odkaz:
http://arxiv.org/abs/1803.06768
Let $k$ be a positive integer and let $D$ be a digraph. A path partition $\sP$ of $D$ is a set of vertex-disjoint paths which covers $V(D)$. Its $k$-norm is defined as $\sum_{P \in \sP} \Min{|V(P)|, k}$. A path partition is $k$-optimal if its $k$-nor
Externí odkaz:
http://arxiv.org/abs/1708.06691
A path (resp. cycle) decomposition of a graph $G$ is a set of edge-disjoint paths (resp. cycles) of $G$ that covers the edge set of $G$. Gallai (1966) conjectured that every graph on $n$ vertices admits a path decomposition of size at most $\lfloor (
Externí odkaz:
http://arxiv.org/abs/1706.04334
Autor:
Sambinelli, Maycon, 1988
Publikováno v:
Repositório Institucional da UnicampUniversidade Estadual de CampinasUNICAMP.
Orientador: Orlando Lee
Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-25T09:16:09Z (GMT). No. of bitstreams: 1 Sambinelli_Maycon_M.pdf: 1793287 bytes, checksum: 1
Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação
Made available in DSpace on 2018-08-25T09:16:09Z (GMT). No. of bitstreams: 1 Sambinelli_Maycon_M.pdf: 1793287 bytes, checksum: 1
Externí odkaz:
http://repositorio.unicamp.br/jspui/handle/REPOSIP/275514
In this paper we introduce a superclass of split digraphs, which we call spine digraphs. Those are the digraphs D whose vertex set can be partitioned into two sets X and Y such that the subdigraph induced by X is traceable and Y is a stable set. We a
Externí odkaz:
http://arxiv.org/abs/1606.06765