Daniel McGinnis

activity

20182026

most citedImproved bounds on a generalization of Tuza's conjecture

3 citations · 10 across the 12 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018

A Method to Construct $1$ -Rotational Factorizations of Complete Graphs and Solutions to the Oberwolfach Problem

Daniel McGinnis, Eirini Poimenidou

The concept of a $1$ -rotational factorization of a complete graph under a finite group $G$ was studied in detail by Buratti and Rinaldi. They found that if $G$ admits a $1$ -rotatio…

math.CO2018★ 1 cited

On the Domination Number of Permutation Graphs and an Application to Strong Fixed Points

Theresa Baren, Michael Cory, Mia Friedberg +6

A permutation graph $G_{π}$ is a simple graph with vertices corresponding to the elements of $π$ and an edge between $i$ and $j$ when $i$ and $j$ are inverted in $π$ . A set of vertic…

math.CO2018★ 1 cited

Extremal Problems Related to the Cardinality Redundance of Graphs

Daniel McGinnis, Nathan Shank

A dominating set of a graph $G$ is a set of vertices $D$ such that for all $v \in V (G)$ , either $v \in D$ or $(v, d) \in E (G)$ for some $d \in D$ . The cardinality redundance of a ve…

A Method to Construct 1-Rotational Factorizations of Complete Graphs and Solutions to the Oberwolfach Problem

On the Domination Number of Permutation Graphs and an Application to Strong Fixed Points

Extremal Problems Related to the Cardinality Redundance of Graphs

A Method to Construct $1$ -Rotational Factorizations of Complete Graphs and Solutions to the Oberwolfach Problem