Jennifer Diemunsch

According to our database, Jennifer Diemunsch authored at least 6 papers between 2012 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2017

Color-blind index in graphs of very low degree.

Jennifer Diemunsch, Nathan Graber, Lucas Kramer, Victor Larsen, Lauren M. Nelsen, Luke L. Nelsen, Devon Sigler, Derrick Stolee, Charlie Suer

Discret. Appl. Math., 2017

A robber locating strategy for trees.

Axel Brandt, Jennifer Diemunsch, Catherine Erbes, J. Legrand, Casey Moffatt

Discret. Appl. Math., 2017

2015

Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem.

Jennifer Diemunsch, Michael Ferrara, Sogol Jahanbekam, James M. Shook

SIAM J. Discret. Math., 2015

A characterization of P5-free graphs with a homeomorphically irreducible spanning tree.

Jennifer Diemunsch, Michitaka Furuya, Maryam Sharifzadeh, Shoichi Tsuchiya, David Wang, Jennifer Wise, Elyse Yeager

Discret. Appl. Math., 2015

2014

On 2-factors with a bounded number of odd components.

Jennifer Diemunsch, Michael Ferrara, Samantha Graffeo, Timothy Morris

Discret. Math., 2014

2012

Rainbow Matchings of Size δ(G) in Properly Edge-Colored Graphs.

Jennifer Diemunsch, Michael Ferrara, Allan Lo, Casey Moffatt, Florian Pfender, Paul S. Wenger

Electron. J. Comb., 2012