On the Number of Matchings in Regular Graphs. - Shmuel Friedland; Elliot Krop; Klas Markström (Electron. J. Comb., 2008)

On the number of unlabeled vertices in edge-friendly labelings of graphs. - Elliot Krop; Sin-Min Lee; Christopher Raridan (Discret. Math., 2012)

Almost -rainbow edge-colorings of some small graphs. - Elliot Krop; Irina Krop (Discuss. Math. Graph Theory, 2013)

General distance domination. - Elliot Krop; Tony Yaacoub (Electron. Notes Discret. Math., 2013)

Nonmedian Direct Products of Graphs with Loops. - Kristi Clark; Elliot Krop (Ars Comb., 2015)

Distance magic Cartesian product of graphs. - Sylwia Cichacz; Dalibor Froncek; Elliot Krop; Christopher Raridan (Discuss. Math. Graph Theory, 2016)

Vizing's conjecture: A two-thirds bound for claw-free graphs. - Elliot Krop (Discret. Appl. Math., 2017)

All trees are six-cordial. - Keith Driscoll; Elliot Krop; Michelle Nguyen (Electron. J. Graph Theory Appl., 2017)

Improved Bounds for Relaxed Graceful Trees. - Christian Barrientos; Elliot Krop (Graphs Comb., 2017)

Upper bounds for inverse domination in graphs. - Elliot Krop; Jessica McDonald; Gregory J. Puleo (CoRR, 2019)

A Vizing-type result for semi-total domination. - John Asplund; Randy Davila; Elliot Krop (Discret. Appl. Math., 2019)

On eternal domination and Vizing-type inequalities. - Keith Driscoll; William F. Klostermeyer; Elliot Krop; Colton Magnant; Patrick Taylor (AKCE Int. J. Graphs Comb., 2020)

Grundy Domination of Forests and the Strong Product Conjecture. - Kayla Bell; Keith Driscoll; Elliot Krop; Kimber Wolff (Electron. J. Comb., 2021)

The Cordiality Game and the Game Cordiality Number. - Elliot Krop; Aryan Mittal; Michael C. Wigal (Graphs Comb., 2024)