• Flesch, Breeann and Nabity, Matthew. Recognition Algorithm for Probe Interval 2-Trees. British Journal of Mathematics & Computer Science, vol. 18(4), 2016, 11 pages.

  • Flesch, Breeann. Fusing Common Core Standards and Graph Theory. TOMT: The Oregon Mathematics Teacher , September/October (2015), 14-15.

  • Flesch, Breeann and Pradhan, Akaanchya. Graph Nim. PURE Insights, Vol. 4, Article 3 (2015). Available here.

  • Brown, David; Flesch, Breeann; and Lundgren, J. Richard. A characterization of 2-tree probe interval graphs. Discussiones Mathematicae Graph Theory 34 (2014), 509-527.

  • Brown, David and Flesch, Breeann. A characterization of 2-tree proper interval 3-graphs. Journal of Discrete Mathematics, vol. 2014, Article ID 143809, 7 pages, 2014.

  • Ferrara, Michael; Flesch, Breeann and Gethner, Ellen. List-distinguishing colorings of graphs. The Electronic Journal of Combinatorics 18 (2011), P161, 17pp.

  • Flesch, Breeann and Tennenhouse, Craig. Edge maximal non-interval graphs. Journal of Combinatorial Mathematics and Combinatorial Computing 77 (2011), 33-44.

  • Flesch, Breeann and Lundgren, J. Richard. A characterization of k-trees that are interval p-graphs. The Australasian Journal of Combinatorics 49 (2011), 227-237.

  • Das Gupta, Shilpa; Flesch, Breeann and Lundgren, J. Richard. Bigraph impropriety. Congressus Numerantium 206 (2010), 115-129.