2 papers
math.CO2019
Vertex-monochromatic connectivity of strong digraphs
Diego González-Moreno, Mucuy-kak Guevara, Juan José Montellano-Ballesteros
A vertex coloring of a strong digraph is a \emph{strong vertex-monochromatic connection coloring (SVMC-coloring)} if for every pair of vertices in there exists an $(…
math.CO2017
Advances on the Conjecture of Erdős-Sós for spiders
Camino Balbuena, Mucuy-Kak Guevara, José R. Portillo +1
- A hamiltonian graph verifying %with a vertex of degree greater or equal than contains any -spider. - If is a graph with average degree $\bar{d} > k…