John Asplund

From MaRDI portal
Person:297915

Available identifiers

zbMath Open asplund.johnMaRDI QIDQ297915

List of research outcomes





PublicationDate of PublicationType
Optimizing redistricting plan selection for U.S. congressional districts with various definitions2025-01-08Paper
Primitive cycle decompositions of Kn and Kn−I2024-02-05Paper
Skolem Number of Cycles and Grid Graphs2021-09-28Paper
https://portal.mardi4nfdi.de/entity/Q49952802021-06-23Paper
Minimum Coprime Labelings of Generalized Petersen and Prism Graphs2021-03-26Paper
New Perspectives on Neighborhood-Prime Labelings of Graphs2020-11-12Paper
\(\mathrm{TS}(v, \lambda)\) with cyclic 2-intersecting Gray codes: \(v\equiv 0\) or \(4\pmod{12}\)2020-04-30Paper
The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination2020-01-08Paper
Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles2019-12-12Paper
Using block designs in crossing number bounds2019-12-10Paper
Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations2019-08-20Paper
$\gamma'$-Realizability and Other Musings on Inverse Domination2019-07-22Paper
Minimum Coprime Labelings for Operations on Graphs2019-06-21Paper
A Vizing-type result for semi-total domination2019-03-22Paper
On the \(k\)-planar local crossing number2019-02-20Paper
Pebbling on Graph Products and other Binary Graph Constructions2019-01-30Paper
Pebbling on Directed Graphs with Fixed Diameter2018-09-07Paper
\(k\)-planar crossing number of random graphs and random regular graphs2018-09-06Paper
Reconfiguration graphs of shortest paths2018-08-15Paper
https://portal.mardi4nfdi.de/entity/Q45662422018-06-14Paper
Enumerating cycles in the graph of overlapping permutations2017-12-20Paper
Decomposition of a complete bipartite multigraph into arbitrary cycle sizes2017-10-11Paper
https://portal.mardi4nfdi.de/entity/Q29609522017-02-17Paper
On a limit of the method of Tashkinov trees for edge-colouring2016-06-20Paper
On the Hamilton-Waterloo problem with triangle factors and \(C_{3x}\)-factors2016-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\)2015-01-30Paper
5-cycle systems of \((\lambda + m) K_{v + 1} - \lambda K_v\) and \(\lambda K_{v + u} - \lambda K_v\)2015-01-30Paper
Enclosings of λ‐Fold 5‐Cycle Systems: Adding One Vertex2014-06-27Paper
A note on proper edge coloring of {bibd}s2012-10-06Paper
Mutually orthogonal equitable Latin rectangles2011-05-16Paper
https://portal.mardi4nfdi.de/entity/Q53935362011-04-18Paper

Research outcomes over time

This page was built for person: John Asplund