John Asplund

From MaRDI portal
(Redirected from Person:297915)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Optimizing redistricting plan selection for U.S. congressional districts with various definitions
Congressus Numerantium
2025-01-08Paper
Primitive cycle decompositions of Kn and Kn−I
Journal of Combinatorial Designs
2024-02-05Paper
Skolem number of cycles and grid graphs
Theory and Applications of Graphs
2021-09-28Paper
New perspectives on neighborhood-prime labelings of graphs2021-06-23Paper
Minimum Coprime Labelings of Generalized Petersen and Prism Graphs
(available as arXiv preprint)
2021-03-26Paper
Minimum Coprime Labelings of Generalized Petersen and Prism Graphs2021-03-26Paper
New perspectives on neighborhood-prime labelings of graphs
(available as arXiv preprint)
2020-11-12Paper
\(\mathrm{TS}(v, \lambda)\) with cyclic 2-intersecting Gray codes: \(v\equiv 0\) or \(4\pmod{12}\)
Graphs and Combinatorics
2020-04-30Paper
The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination
Discussiones Mathematicae Graph Theory
2020-01-08Paper
Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles
Discrete Mathematics
2019-12-12Paper
Using block designs in crossing number bounds
Journal of Combinatorial Designs
2019-12-10Paper
Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations
Discrete Mathematics
2019-08-20Paper
$\gamma'$-Realizability and Other Musings on Inverse Domination
Theory and Applications of Graphs
2019-07-22Paper
Minimum coprime labelings for operations on graphs2019-06-21Paper
Minimum coprime labelings for operations on graphs
(available as arXiv preprint)
2019-06-21Paper
A Vizing-type result for semi-total domination
Discrete Applied Mathematics
2019-03-22Paper
On the \(k\)-planar local crossing number
Discrete Mathematics
2019-02-20Paper
Pebbling on graph products and other binary graph constructions2019-01-30Paper
Pebbling on graph products and other binary graph constructions
(available as arXiv preprint)
2019-01-30Paper
Pebbling on Directed Graphs with Fixed Diameter2018-09-07Paper
\(k\)-planar crossing number of random graphs and random regular graphs
Discrete Applied Mathematics
2018-09-06Paper
Reconfiguration graphs of shortest paths
Discrete Mathematics
2018-08-15Paper
A note on total domination edge critical graphs2018-06-14Paper
Enumerating cycles in the graph of overlapping permutations
Discrete Mathematics
2017-12-20Paper
Decomposition of a complete bipartite multigraph into arbitrary cycle sizes
Graphs and Combinatorics
2017-10-11Paper
Some bounds on the size of DI-pathological graphs2017-02-17Paper
On a limit of the method of Tashkinov trees for edge-colouring
Discrete Mathematics
2016-06-20Paper
On the Hamilton-Waterloo problem with triangle factors and \(C_{3x}\)-factors
The Australasian Journal of Combinatorics
2016-04-18Paper
On the Hamilton-Waterloo problem with triangle factors and \(C_{3x}\)-factors
The Australasian Journal of Combinatorics
2016-04-18Paper
$m$-Cycle Packings of $(\lambda+\mu)K_{v+u}-\lambda K_v$: $m$ even2015-11-30Paper
Packing paths in a $(\lambda+\mu)K_{v+u}-\lambda K_v$2015-11-03Paper
Enclosings of \(\lambda\)-fold 5-cycle systems for \(u = 2\)
Discrete Mathematics
2015-01-30Paper
5-cycle systems of \((\lambda + m) K_{v + 1} - \lambda K_v\) and \(\lambda K_{v + u} - \lambda K_v\)
Discrete Mathematics
2015-01-30Paper
Enclosings of \(\lambda \)-fold 5-cycle systems: adding one vertex
Journal of Combinatorial Designs
2014-06-27Paper
A note on proper edge coloring of {bibd}s
Bulletin of the Institute of Combinatorics and its Applications
2012-10-06Paper
Mutually orthogonal equitable Latin rectangles
Discrete Mathematics
2011-05-16Paper
scientific article; zbMATH DE number 5879543 (Why is no real title available?)2011-04-18Paper


Research outcomes over time


This page was built for person: John Asplund