Site-wide links

Scholarly Works

Paul Wenger
Associate Professor

2015 Submissions

Journal Paper

Ferrara, Michael, et al. "Graph Saturation in Multipartite Graphs." Journal of Combinatorics 7. 1 (2016): 1-19. Print. *

2014 Submissions

Journal Paper

MacDonald, Lori, Paul S. Wenger, and Scott Wright. "Total Acquisition on Grids." The Australasian Journal of Combinatorics 58. 1 (2014): 137-156. Web. *

Wenger, Paul S. "A Note on the Saturation Number of the Family of k-connected Graphs." Discrete Mathematics 323. (2014): 81-83. Print. *

Wenger, Paul S. "Fractional Acquisition in Graphs." Discrete Applied Mathematics 178. (2014): 142-148. Print. *

Published Conference Proceedings

Ziemann, Amanda, David W. Messinger, and Paul S. Wenger. "An Adaptive k-nearest Neighbor Graph Building Technique with Applications to Hyperspectral Imagery." Proceedings of the IEEE Western New York Image and Signal Processing Workshop, Henrietta, NY November 2014. Ed. Nathan Cahill. Red Hook, NY: n.p., 2014. Print. £

2013 Submissions

Journal Paper

Ferrara, Michael, Colton Magnant, and Paul S. Wenger. "Conditions for Families of Disjoint K-connected Subgraphs in a Graph." Discrete Mathematics 313. 6 (2013): 760-764. Print. «

Ferrara, Michael, et al. "List Distinguishing Parameters of Trees." Discrete Applied Mathematics 161. 6 (2013): 864-869. Print. «

LeSaulnier, Timothy D., et al. "Total Acquisition in Graphs." SIAM Journal on Discrete Mathematics 27. 4 (2013): 1800-1819. Print. «

2012 Submissions

Journal Paper

Cooper, Joshua, et al. "Uniquely C4-saturated Graphs." Graphs and Combinatorics 28. 2 (2012): 189-197. Print. £

Diemunsch, Jennifer, et al. "Rainbow Matchings of Size Delta(G) in Properly Edge-Colored Graphs." Electronic Journal of Combinatorics 19. 2 (2012): #P52. Web. £

Ferrara, Michael, et al. "Saturation Numbers for Families of Graph Subdivisions." Journal of Graph Theory 71. 4 (2012): 416-434. Print. £

Ferrara, Michael, Timothy Morris, and Paul Wenger. "Pancyclicity of 4-Connected, Claw-Free, P10-Free Graphs." Journal of Graph Theory 71. 4 (2012): 435-447. Print. £