10 citations · 11 across the 6 of their papers we have counts for
7 papers
Every subcubic multigraph is -packing edge-colorable
Xujun Liu, Michael Santana, Taylor Short
For a non-decreasing sequence of positive integers, an -packing edge-coloring of a graph is a decomposition of edges of into disjoint sets $E_1,…
Strong chromatic index of graphs with maximum degree four
Mingfang Huang, Michael Santana, Gexin Yu
A strong edge-coloring of a graph is a coloring of the edges such that every color class induces a matching in . The strong chromatic index of a graph is the minimum number…
A refinement of theorems on vertex-disjoint chorded cycles
Theodore Molla, Michael Santana, Elyse Yeager
In 1963, Corrádi and Hajnal settled a conjecture of Erdős by proving that, for all , any graph with and minimum degree at least contains vertex…
Landau's Theorem Revisited Again
K. B. Reid, M. Santana
We give a new proof of the sufficiency of Landau's conditions for a non-decreasing sequence of integers to be the score sequence of a tournament. The proof involves jumping down a…
Strong chromatic index of subcubic planar multigraphs
A. V. Kostochka, X. Li, W. Ruksasakchai +3
The strong chromatic index of a multigraph is the minimum such that the edge set can be -colored requiring that each color class induces a matching. We verify a conjecture o…
-intersection edge-coloring subcubic planar multigraphs
M. Santana
Given an edge-coloring of a simple graph, assign to every vertex a set comprised of the colors used on the edges incident to . The -intersection chromatic index of…
Graphs with induced-saturation number zero
Sarah Behrens, Catherine Erbes, Michael Santana +2
Given graphs and , is -saturated if is not a subgraph of , but for all , appears as a subgraph of . While for every , t…