Zobrazeno 1 - 10
of 76
pro vyhledávání: '"Sánchez-López, Rocío"'
Let $G$ be an edge-colored graph, a walk in $G$ is said to be a properly colored walk iff each pair of consecutive edges have different colors, including the first and the last edges in case that the walk be closed. Let $H$ be a graph possible with l
Externí odkaz:
http://arxiv.org/abs/2207.01699
Let $D=(V,A)$ be a digraph and $\mathfrak{S}$ a partition of $V(D)$. We say that $\mathfrak{S}$ is a strong in-domatic partition if every $S$ in $\mathfrak{S}$ holds that every vertex not in $S$ has at least one out-neighbor in $S$, that is $S$ is an
Externí odkaz:
http://arxiv.org/abs/2204.01822
Let $H$ be a digraph possibly with loops and $D$ a digraph without loops with a coloring of its arcs $c:A(D) \rightarrow V(H)$ ($D$ is said to be an $H$-colored digraph). A directed path $W$ in $D$ is said to be an $H$-path if and only if the consecu
Externí odkaz:
http://arxiv.org/abs/2006.03691
Publikováno v:
In Theoretical Computer Science 10 February 2023 946
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 42, Iss 2, Pp 601-611 (2022)
In [Independent transversal domination in graphs, Discuss. Math. Graph Theory 32 (2012) 5–17], Hamid claims that if G is a connected bipartite graph with bipartition {X, Y } such that |X| ≤ |Y| and |X| = γ(G), then γit(G) = γ(G) + 1 if and onl
Externí odkaz:
https://doaj.org/article/977c33dcfb124e2fb98647c9b20f83b1
Publikováno v:
In Applied Mathematics and Computation 15 July 2022 425
Autor:
Galeana-Sánchez, Hortensia, Hernández-Lorenzana, Felipe, Sánchez-López, Rocío, Vilchis-Alfaro, Carlos
Publikováno v:
Boletín de la Sociedad Matemática Mexicana; Jul2024, Vol. 30 Issue 2, p1-15, 15p
Publikováno v:
In Discrete Applied Mathematics 15 December 2021 304:352-364
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 2, Pp 391-408 (2021)
Let H be a digraph (possibly with loops) and D a digraph without loops whose arcs are colored with the vertices of H (D is said to be an H-colored digraph). For an arc (x, y) of D, its color is denoted by c(x, y). A directed path W = (v0, . . ., vn)
Externí odkaz:
https://doaj.org/article/4d6138b82e5342cfacfd911940c59311
Cycles of length 3 and 4 in edge-colored complete graphs with restrictions in the color transitions.
Publikováno v:
Boletín de la Sociedad Matemática Mexicana; Nov2024, Vol. 30 Issue 3, p1-18, 18p