Buchanan, Calum, DuPreez, Brandon, Perry, K E, and Rombach, Puck. Toughness of Recursively Partitionable Graphs. Retrieved from https://par.nsf.gov/biblio/10516647. Theory and Applications of Graphs 10.2 Web. doi:10.20429/tag.2023.10204.

Buchanan, Calum, DuPreez, Brandon, Perry, K E, & Rombach, Puck. Toughness of Recursively Partitionable Graphs. Theory and Applications of Graphs, 10 (2). Retrieved from https://par.nsf.gov/biblio/10516647. https://doi.org/10.20429/tag.2023.10204

Buchanan, Calum, DuPreez, Brandon, Perry, K E, and Rombach, Puck. "Toughness of Recursively Partitionable Graphs". Theory and Applications of Graphs 10 (2). Country unknown/Code not available: Georgia Southern. https://doi.org/10.20429/tag.2023.10204. https://par.nsf.gov/biblio/10516647.

@article{osti_10516647,
place = {Country unknown/Code not available}, title = {Toughness of Recursively Partitionable Graphs}, url = {https://par.nsf.gov/biblio/10516647}, DOI = {10.20429/tag.2023.10204}, abstractNote = {}, journal = {Theory and Applications of Graphs}, volume = {10}, number = {2}, publisher = {Georgia Southern}, author = {Buchanan, Calum and DuPreez, Brandon and Perry, K E and Rombach, Puck}, editor = {Ye, Dong} }