1 citations · 1 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2023
Component order edge connectivity, vertex degrees, and integer partitions
Michael Yatauro
Given a finite, simple graph , the -component order edge connectivity of is the minimum number of edges whose removal results in a subgraph for which every component has…
math.CO2014★ 1 cited
A Survey of Best Monotone Degree Conditions for Graph Properties
D. Bauer, H. J. Broersma, J. van den Heuvel +5
We survey sufficient degree conditions, for a variety of graph properties, that are best possible in the same sense that Chvatal's well-known degree condition for hamiltonicity is…