Paul S. Wenger

activity

20112018

most citedOn the Sum Neccesary to Ensure that a Degree Sequence is Potentially H-Graphic

2 citations · 5 across the 9 of their papers we have counts for

collaborators

Showing 2015Show all

3 papers · 1 filter

math.CO2015

The List Distinguishing Number Equals the Distinguishing Number for Interval Graphs

Poppy Immel, Paul S. Wenger

A \textit{distinguishing coloring} of a graph $G$ is a coloring of the vertices so that every nontrivial automorphism of $G$ maps some vertex to a vertex with a different color. Th…

math.CO2015

Uniquely cycle-saturated graphs

Paul S. Wenger, Douglas B. West

Given a graph $F$ , a graph $G$ is {\it uniquely $F$ -saturated} if $F$ is not a subgraph of $G$ and adding any edge of the complement to $G$ completes exactly one copy of $F$ . In th…

math.CO2015

Planar digraphs without large acyclic sets

Kolja Knauer, Petru Valicov, Paul S. Wenger

Given a directed graph, an acyclic set is a set of vertices inducing a subgraph with no directed cycle. In this note we show that there exist oriented planar graphs of order $n$ fo…