2 citations · 2 across the 4 of their papers we have counts for
6 papers · 1 filter
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,…
Independent Sets in n-vertex k-chromatic, \ell-connected graphs
John Engbers, Lauren Keough, Taylor Short
We study the problem of maximizing the number of independent sets in -vertex -chromatic -connected graphs. First we consider maximizing the total number of independent…
The saturation number of carbon nanocones and nanotubes
Taylor Short
The saturation number of a graph is the cardinality of a smallest maximal matching. This paper presents bounds for the saturation number of carbon nanocones which are asymptoticall…
Maximal matchings in polyspiro and benzenoid chains
Tomislav Došlić, Taylor Short
A matching of a graph is maximal if it is not a proper subset of any other matching in . Maximal matchings are much less known and researched than their maximum and perf…
On the Number of Non-zero Elements of Joint Degree Vectors
Eva Czabarka, Johannes Rauh, Kayvan Sadeghi +2
Joint degree vectors give the number of edges between vertices of degree and degree for in an -vertex graph. We find lower and upper bounds for the…
On some conjectures concerning critical independent sets of a graph
Taylor Short
Let be a simple graph with vertex set . A set is independent if no two vertices from are adjacent. For , the difference of is $…