A Direct Proof of the Integral Formulae for the Inverse Hyperbolic Functions von Engbers, John, Hammett, Adam

Volltext

Maximizing the Number of H-Colorings of Graphs with a Fixed Minimum Degree von Engbers, John

Volltext

Extremal graphs for average sizes of maximal matchings von Engbers, John, Erey, Aysel

Volltext

Extremal Graphs for Widom–Rowlinson Colorings in k-Chromatic Graphs von Engbers, John, Erey, Aysel

Volltext

Oral Ibuprofen Is More Effective than Intravenous Ibuprofen for Closure of a Patent Ductus Arteriosus: Can Pharmacokinetic Modeling Help Us to Understand Why? von Smit, Cornelis, Engbers, Aline G.J., Samiee-Zafarghandy, Samira, van Donge, Tamara, Simons, Sinno H.P., Flint, Robert B., Pfister, Marc, Knibbe, Catherijne A.J., van den Anker, John N.

Volltext

Exploring the lived experiences of adults using home enteral nutrition and their caregivers: A meta-aggregation qualitative systematic review von Sandhu, Rebekah, Elliott, Treeva, Hussain, Whitney, Engbers, John, Kassam, Rosemin

Volltext

Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree von Engbers, John

Volltext

Independent sets in n-vertex k-chromatic ℓ-connected graphs von Engbers, John, Keough, Lauren, Short, Taylor

Volltext

Reversible peg solitaire on graphs von Engbers, John, Stocker, Christopher

Volltext

Maximizing and minimizing the number of generalized colorings of trees von Engbers, John, Stocker, Christopher

Volltext

Extremal Colorings and Independent Sets von Engbers, John, Erey, Aysel

Volltext

Restricted Stirling and Lah number matrices and their inverses von Engbers, John, Galvin, David, Smyth, Cliff

Volltext

Extremal H-Colorings of Graphs with Fixed Minimum Degree von Engbers, John

Volltext

Extremal H-colorings of trees and 2-connected graphs von Engbers, John, Galvin, David

Volltext

Counting Independent Sets of a Fixed Size in Graphs with a Given Minimum Degree von Engbers, John, Galvin, David

Volltext

Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs von Engbers, John, Erey, Aysel, Fox, Jacob, He, Xiaoyu

Volltext

The n-Children Problem von Engbers, John, Hammett, Adam

Volltext

To Replace or Not to Replace - That is the Question von Engbers, John, Hammett, Adam

Volltext

Merging peg solitaire on graphs von Engbers, John, Weber, Ryan

Volltext

Combinatorially interpreting generalized Stirling numbers von Engbers, John, Galvin, David, Hilyard, Justin

Volltext