3 citations · 3 across the 4 of their papers we have counts for
5 papers · 1 filter
Rainbow triangles and cliques in edge-colored graphs
Stefan Ehard, Elena Mohr
For an edge-colored graph, a subgraph is called rainbow if all its edges have distinct colors. We show that if is an edge-colored graph of order and size using colo…
On the maximum number of maximum independent sets in connected graphs
E. Mohr, D. Rautenbach
We characterize the connected graphs of given order and given independence number that maximize the number of maximum independent sets. For , there is a un…
On the maximum number of maximum independent sets
Elena Mohr, Dieter Rautenbach
We give a very short and simple proof of Zykov's generalization of Turán's theorem, which implies that the number of maximum independent sets of a graph of order and independen…
On the maximum number of minimum dominating sets in forests
J. D. Alvarado, S. Dantas, E. Mohr +1
Fricke, Hedetniemi, Hedetniemi, and Hutson asked whether every tree with domination number has at most minimum dominating sets. Bien gave a counterexample, which allows t…
On the maximum number of minimum total dominating sets in forests
Michael A. Henning, Elena Mohr, Dieter Rautenbach
We propose the conjecture that every tree with order at least and total domination number has at most $\left(\frac{n-\frac{γ_t}{2}}{\frac{γ_t}{2}}\right)^{\frac{γ_t}{…