N. Cordero-Michel

activity

20182025

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2025

Redicoloring some classes of circulant tournaments

Narda Cordero-Michel, Mika Olsen

Given a digraph $D$ with no loops, the \textit{dicoloring graph} of $D$ , denoted by $D_{k} (D)$ , is the graph whose vertices are the acyclic $k$ -colorings of $D$ and two col…

math.CO2021

Pancyclism in the Generalized Sum of Digraphs

Narda Cordero-Michel, Hortensia Galeana-Sánchez

A digraph $D = (V, A)$ of order $n \geq 3$ is pancyclic, whenever $D$ contains a directed cycle of length $k$ for each $k \in {3, ..., n}$ ; and D is vertex-pancyclic iff, for each vertex…

math.CO2020

Vertex-Pancyclism in the Generalized Sum of Digraphs

N. Cordero-Michel, H. Galeana-Sánchez

A digraph $D = (V (D)$ , $A (D))$ of order $n \geq 3$ is pancyclic, whenever $D$ contains a directed cycle of length $k$ for each $k \in {3, \dots, n}$ ; and $D$ is vertex-pancyclic iff,…

math.CO2019

Vertex Alternating-Pancyclism in 2-Edge-Colored Graphs

Narda Cordero-Michel, Hortensia Galeana-Sánchez

An alternating cycle in a 2-two-edge-colored graph is a cycle such that any two consecutive edges have different colors. Let $G_{1}, \dots, G_{k}$ be a collection of pairwise vertex d…

math.CO2018

New Bounds for the Dichromatic Number of a Digraph

Narda Cordero-Michel, Hortensia Galeana-Sánchez

The chromatic number of a graph $G$ , denoted by $χ (G)$ , is the minimum $k$ such that $G$ admits a $k$ -coloring of its vertex set in such a way that each color class is an independe…