3 papers
math.CO2026
The forbidden structure for zero forcing number
Carlos A. Alfaro, Michael D. Barrus, Sergio Gerardo Gómez-Galicia +5
The {\it zero forcing number} of a graph , , is a well-studied parameter which arises from a color changing process and has strong connections to {\it minimum rank}, {\it…
math.CO2025
Kernels in digraphs with colored vertices
Mucuy-kak Guevara, Teresa I. Hoekstra-Mendoza, Miguel Licona-Velazquez
In this paper, we introduce the concept of up-color kernel, which is a generalization of a kernel for vertex-colored digraphs. We give sufficient and necessary conditions for sever…
math.CO2024
Gracefulness of two nested cycles: a first approach
Miguel Licona, Joaquín Tey
It is known that if a plane graph is graceful (resp. near-graceful), then its semidual is conservative (resp. near-conservative). In this work we prove that the semidual of a plane…