2 citations · 2 across the 4 of their papers we have counts for
Showing 2015 · math.COShow all
3 papers · 2 filters
math.CO2015
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…
math.CO2015
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…
math.CO2015
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 $…