Timothy D. LeSaulnier

According to our database, Timothy D. LeSaulnier authored at least 9 papers between 2006 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2016

On the sum necessary to ensure that a degree sequence is potentially H-graphic.

Michael J. Ferrara, Timothy D. LeSaulnier, Casey Moffatt, Paul S. Wenger

Comb., 2016

2013

Total Acquisition in Graphs.

Timothy D. LeSaulnier, Noah Prince, Paul S. Wenger, Douglas B. West, Pratik Worah

SIAM J. Discret. Math., 2013

Rainbow edge-coloring and rainbow domination.

Timothy D. LeSaulnier, Douglas B. West

Discret. Math., 2013

Acquisition-extremal graphs.

Timothy D. LeSaulnier, Douglas B. West

Discret. Appl. Math., 2013

2012

Overlap number of graphs.

Daniel W. Cranston, Nitish Korula, Timothy D. LeSaulnier, Kevin G. Milans, Christopher J. Stocker, Jennifer Vandenbussche, Douglas B. West

J. Graph Theory, 2012

Uniquely C 4-Saturated Graphs.

Joshua N. Cooper, John Lenz, Timothy D. LeSaulnier, Paul S. Wenger, Douglas B. West

Graphs Comb., 2012

2011

On permutations avoiding arithmetic progressions.

Timothy D. LeSaulnier, Sujith Vijay

Discret. Math., 2011

2010

Rainbow Matching in Edge-Colored Graphs.

Timothy D. LeSaulnier, Christopher J. Stocker, Paul S. Wenger, Douglas B. West

Electron. J. Comb., 2010

2006

Finding a Repeated Difference: 11084.

H. A. ShahAli, Timothy D. LeSaulnier

Am. Math. Mon., 2006