65 citations
- University of ConnecticutUS3 papers
- Austin Peay State UniversityUS2 papers
- Winthrop UniversityUS2 papers
- Auburn UniversityUS1 paper
- California Institute of TechnologyUS1 paper
- Clayton State UniversityUS1 paper
- Délégation Paris 7FR1 paper
- Harvard UniversityUS1 paper
- Harvard University PressUS1 paper
- Howard UniversityUS1 paper
- Institut de Recherche en Informatique FondamentaleFR1 paper
- Institut national de recherche en sciences et technologies du numériqueFR1 paper
5 papers · 2 filters
Enclosings of Decompositions of Complete Multigraphs in -Edge-Connected -Factorizations
John Asplund, Pierre Charbit, Carl Feghali
A decomposition of a multigraph is a partition of its edges into subgraphs . It is called an -factorization if every is -regular and spanning.…
with cyclic 2-intersecting Gray codes: or
John Asplund, Melissa Keranen
A is a pair where contains points and contains -element subsets of so that each pair in appears in exactly b…
New Perspectives on Neighborhood-Prime Labelings of Graphs
John Asplund, N. Bradley Fox, Arran Hamm
Neighborhood-prime labeling is a variation of prime labeling. A labeling is a neighborhood-prime labeling if for each vertex with degree greater t…
On the k-planar local crossing number
John Asplund, Thao do, Arran Hamm +1
Given a fixed positive integer , the -planar local crossing number of a graph , denoted by , is the minimum positive integer such that can be deco…
A Vizing-type result for semi-total domination
John Asplund, Randy Davila, Elliot Krop
A set of vertices in a simple isolate-free graph is a semi-total dominating set of if it is a dominating set of and every vertex of is within distance 2 or less…