M. Santana

collaborators

3 papers

math.CO2018

Strong chromatic index of graphs with maximum degree four

Mingfang Huang, Michael Santana, Gexin Yu

A strong edge-coloring of a graph $G$ is a coloring of the edges such that every color class induces a matching in $G$ . The strong chromatic index of a graph is the minimum number…

math.CO2015

$k$ -intersection edge-coloring subcubic planar multigraphs

M. Santana

Given an edge-coloring of a simple graph, assign to every vertex $v$ a set $S_{v}$ comprised of the colors used on the edges incident to $v$ . The $k$ -intersection chromatic index of…

math.CO2015

Graphs with induced-saturation number zero

Sarah Behrens, Catherine Erbes, Michael Santana +2

Given graphs $G$ and $H$ , $G$ is $H$ -saturated if $H$ is not a subgraph of $G$ , but for all $e \in / E (G)$ , $H$ appears as a subgraph of $G + e$ . While for every $n \geq ∣ V (H) ∣$ , t…

Strong chromatic index of graphs with maximum degree four

k-intersection edge-coloring subcubic planar multigraphs

Graphs with induced-saturation number zero

$k$ -intersection edge-coloring subcubic planar multigraphs