Zobrazeno 1 - 10
of 34
pro vyhledávání: '"Colucci Lucas"'
Autor:
Colucci Lucas, Győri Ervin
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 1, Pp 39-46 (2022)
We extend a result of Griggs and Yeh about the maximum possible value of the L(2, 1)-labeling number of a graph in terms of its maximum degree to oriented graphs. We consider the problem both in the usual definition of the oriented L(2, 1)-labeling n
Externí odkaz:
https://doaj.org/article/a5a8dd9a4226424695a6b852ece397dd
The $\!{}\bmod k$ chromatic index of a graph $G$ is the minimum number of colors needed to color the edges of $G$ in a way that the subgraph spanned by the edges of each color has all degrees congruent to $1\!\!\pmod k$. Recently, the authors proved
Externí odkaz:
http://arxiv.org/abs/2207.04254
Publikováno v:
Journal of Integer Sequences, Vol. 23 (2020), Article 20.10.7
In this paper, we investigate two variations on the so-called persistence problem of Sloane: the shifted version, which was introduced by Wagstaff; and the nonzero version, proposed by Erd\H{o}s. We explore connections between these problems and a re
Externí odkaz:
http://arxiv.org/abs/2009.01114
Let $\chi'_k(G)$ denote the minimum number of colors needed to color the edges of a graph $G$ in a way that the subgraph spanned by the edges of each color has all degrees congruent to $1 \pmod k$. Scott [{\em Discrete Math. 175}, 1-3 (1997), 289--29
Externí odkaz:
http://arxiv.org/abs/2007.08324
Autor:
Colucci, Lucas, Győri, Ervin
We refine two results of Jiang, Shao and Vesel on the $L(2,1)$-labeling number $\lambda$ of the Cartesian and the strong product of two oriented cycles. For the Cartesian product, we compute the exact value of $\lambda(\overrightarrow{C_m} \square \o
Externí odkaz:
http://arxiv.org/abs/1912.00457
In this note, we improve on results of Hoppen, Kohayakawa and Lefmann about the maximum number of edge colorings without monochromatic copies of a star of a fixed size that a graph on $n$ vertices may admit. Our results rely on an improved applicatio
Externí odkaz:
http://arxiv.org/abs/1903.04541
Autor:
Colucci, Lucas, Győri, Ervin
We extend a result of Griggs and Yeh about the maximum possible value of the L(2,1)-labeling number of a graph in terms of its maximum degree to oriented graphs. We consider the problem both in the usual definition of the oriented L(2,1)-labeling num
Externí odkaz:
http://arxiv.org/abs/1902.05467
Publikováno v:
Theoretical Computer Science, Volume 775, 5 July 2019, Pages 16-25
We investigate the terminal-pairability problem in the case when the base graph is a complete bipartite graph, and the demand graph is a (not necessarily bipartite) multigraph on the same vertex set. In computer science, this problem is known as the
Externí odkaz:
http://arxiv.org/abs/1705.02124
Publikováno v:
Discrete Applied Mathematics, Volume 236, 19 February 2018, Pages 459-463
We investigate the terminal-pairibility problem in the case when the base graph is a complete bipartite graph, and the demand graph is also bipartite with the same color classes. We improve the lower bound on maximum value of $\Delta(D)$ which still
Externí odkaz:
http://arxiv.org/abs/1702.04313
Autor:
Botler, Fábio1 (AUTHOR), Colucci, Lucas2 (AUTHOR) lucas.colucci.souza@gmail.com, Kohayakawa, Yoshiharu2 (AUTHOR)
Publikováno v:
Journal of Graph Theory. Aug2023, Vol. 103 Issue 4, p767-779. 13p.