On the Hamilton-Waterloo Problem with triangle factors and J Asplund, D Kamin, M Keranen, A Pastine, S Özkan
arXiv preprint arXiv:1510.04607, 2015
20 2015 A Vizing-type result for semi-total domination J Asplund, R Davila, E Krop
Discrete Applied Mathematics 258, 8-12, 2019
18 2019 Reconfiguration graphs of shortest paths J Asplund, K Edoh, R Haas, Y Hristova, B Novick, B Werner
Discrete Mathematics 341 (10), 2938-2948, 2018
14 2018 Minimum coprime labelings of generalized Petersen and prism graphs J Asplund, NB Fox
arXiv preprint arXiv:1908.06051, 2019
11 2019 Pebbling on graph products and other binary graph constructions J Asplund, G Hurlbert, F Kenter
arXiv preprint arXiv:1801.07808, 2018
10 2018 Decomposition of a complete bipartite multigraph into arbitrary cycle sizes J Asplund, J Chaffee, JM Hammer
Graphs and Combinatorics 33, 715-728, 2017
7 2017 On a limit of the method of Tashkinov trees for edge-colouring J Asplund, J McDonald
Discrete Mathematics 339 (9), 2231-2238, 2016
7 2016 Enclosings of λ‐fold 5‐cycle systems: Adding one vertex J Asplund, CA Rodger, MS Keranen
Journal of Combinatorial Designs 22 (5), 196-215, 2014
6 2014 Using block designs in crossing number bounds J Asplund, G Clark, G Cochran, É Czabarka, A Hamm, G Spencer, ...
Journal of Combinatorial Designs 27 (10), 586-597, 2019
5 2019 Enclosings of λ-fold 5-cycle systems for u= 2 J Asplund, CA Rodger, MS Keranen
Discrete Mathematics 338 (5), 743-765, 2015
5 2015 5-cycle systems of (λ+ m) Kv+ 1− λKv and λKv+ u− λKv J Asplund
Discrete Mathematics 338 (5), 766-783, 2015
4 2015 Primitive cycle decompositions of J Asplund, C Dinavahi, K Owsley, MW Schroeder
Journal of Combinatorial Designs 30 (3), 152-192, 2022
3 2022 Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles J Asplund, B Werner
Discrete Mathematics 343 (1), 111640, 2020
3 2020 The Slater and sub-k-domination number of a graph with applications to domination and k-domination D Amos, J Asplund, B Brimkov, R Davila
Discussiones Mathematicae Graph Theory 40 (1), 209-225, 2019
3 2019 On the k-planar local crossing number J Asplund, T Do, A Hamm, V Jain
Discrete Mathematics 342 (4), 927-933, 2019
3 2019 New Perspectives on Neighborhood-Prime Labelings of Graphs J Asplund, NB Fox, A Hamm
arXiv preprint arXiv:1804.02473, 2018
3 2018 Enumerating cycles in the graph of overlapping permutations J Asplund, NB Fox
Discrete Mathematics 341 (2), 427-438, 2018
3 2018 J Asplund, M Keranen
Graphs and Combinatorics 36 (3), 415-436, 2020
2 2020 A note on total domination edge critical graphs J Asplund, M Loizeaux, LC van der Merwe
The Journal of Combinatorial Mathematics and Combinatorial Computing 104 …, 2018
2 2018 Some bounds on the size of DI-pathological graphs J Asplund, J Chaffee, JM Hammer
J. Combin. Math. Combin. Comput 99, 107-129, 2016
2 2016 
Melissa KeranenDepartment of Mathematical Sciences, Michigan Technological UniversityEmail verificata su mtu.edu
