Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Maycon Sambinelli"'
Publikováno v:
Journal of Graph Theory. 93:328-349
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c66ce324ceebf303a27dff2436864d8e
https://doi.org/10.1002/jgt.22489
https://doi.org/10.1002/jgt.22489
Publikováno v:
LAGOS
Gallai (1966) conjectured that the edge set of every graph G on n vertices can be covered by at most ⌈n/2⌉ edge-disjoint paths. Such a covering by edge-disjoint paths is called a path decomposition, and the size of a path decomposition with a min
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a87dee6515c1fc7d720d57b5e9548e7a
https://doi.org/10.1016/j.entcs.2019.08.017
https://doi.org/10.1016/j.entcs.2019.08.017
Publikováno v:
LAGOS
A path partition P of a digraph D is a collection of directed paths such that every vertex belongs to precisely one path. Given a positive integer k, the k-norm of a path partition P of D is defined as ∑ P ∈ P min { | P i | , k } . A path par
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f0c0bdf15519553e3928c1fef4646e7a
https://doi.org/10.1016/j.entcs.2019.08.064
https://doi.org/10.1016/j.entcs.2019.08.064
Publikováno v:
Graphs and Combinatorics. 35:921-931
Let k be a positive integer and let D be a digraph. A path partition $$\mathcal {P}$$ of D is a set of vertex-disjoint paths which covers V(D). Its k-norm is defined as $$\sum _{P \in \mathcal {P}} \min \{|V(P)|, k\}$$ . A path partition is k-optimal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ef962ec79ce3593c0795988b116b224
https://doi.org/10.1007/s00373-019-02046-x
https://doi.org/10.1007/s00373-019-02046-x
Publikováno v:
Discrete Mathematics. 342:1403-1414
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4be85b3f7820960319c061c7c531b02
https://doi.org/10.1016/j.disc.2019.01.020
https://doi.org/10.1016/j.disc.2019.01.020
Publikováno v:
Electronic Notes in Discrete Mathematics. 62:111-116
Let k be a positive integer and let D be a digraph. A (path) k-pack P k of D is a collection of at most k vertex-disjoint paths in D. The weight of a k-pack P k is the number of vertices covered by it and we say P k is optimal if its weight is maximu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::03e76f96723411e6cc5c056d400a9323
https://doi.org/10.1016/j.endm.2017.10.020
https://doi.org/10.1016/j.endm.2017.10.020
Autor:
Fábio Botler, Maycon Sambinelli
Publikováno v:
Electronic Notes in Discrete Mathematics. 62:147-152
Gallai conjectured (1966) that the edge-set of a simple graph G with n vertices can be covered by at most ( n + 1 ) / 2 edge-disjoint paths. Lovasz [Lovasz, L., On covering of graphs, in: Theory of Graphs (Proc. Colloq., Tihany, 1966), Academic Press
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c903410315fc6a70056d1708a68c8a5a
https://doi.org/10.1016/j.endm.2017.10.026
https://doi.org/10.1016/j.endm.2017.10.026
Publikováno v:
Discrete Mathematics. 340:851-854
A path partition P of a digraph D is a set of disjoint paths which covers V(D). Let k be a positive integer. The k-norm of a path partition P of a digraph is defined as PPmin{|V(P)|,k}. Let k(D) denote the smallest k-norm among all path partitions of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aeaf5188b5a82e75dbcb1e08f2aae1e7
https://doi.org/10.1016/j.disc.2016.12.017
https://doi.org/10.1016/j.disc.2016.12.017
Publikováno v:
Revista Eletrônica de Iniciação Científica em Computação; v. 17, n. 2 (2019): Edição Especial: Artigos do 38º Concurso de Trabalhos de Iniciação Científica (CSBC/CTIC)
A \emph{path partition} $\mathcal{P}$ of a digraph $D$ is a collection of directed paths such that every vertex belongs to precisely one path. Given a positive integer $k$, the $k$-norm of a path partition $\mathcal{P}$ of $D$ is defined as $\sum_{P
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::350ca9bdef639ad0b4300fceecf7c954
https://seer.ufrgs.br/reic/article/view/93601
https://seer.ufrgs.br/reic/article/view/93601