research
∙
04/11/2020
A lower bound on the saturation number, and graphs for which it is sharp
Let H be a fixed graph. We say that a graph G is H-saturated if it has n...
share
research
∙
01/14/2020
Strong coloring 2-regular graphs: Cycle restrictions and partial colorings
Let H be a graph with Δ(H) ≤ 2, and let G be obtained from H by gluing i...
research
∙
07/12/2019
Upper bounds for inverse domination in graphs
In any graph G, the domination number γ(G) is at most the independence n...
research
∙
04/30/2019
Some results on multithreshold graphs
Jamison and Sprague defined a graph G to be a k-threshold graph with thr...
research
∙
11/05/2018
