A. Erey

activity

20132023

x

-colorings of

4

-chromatic graphs

8 citations · 26 across the 13 of their papers we have counts for

collaborators

Showing 2019Show all

2 papers · 1 filter

math.CO2019

Tomescu's graph coloring conjecture for $ℓ$ -connected graphs

John Engbers, Aysel Erey, Jacob Fox +1

Let $P_{G} (k)$ be the number of proper $k$ -colorings of a finite simple graph $G$ . Tomescu's conjecture, which was recently solved by Fox, He, and Manners, states that $P_G(k) \le k!…

math.CO2019★ 5 cited

Uniform Length Dominating Sequence Graphs

Aysel Erey

A sequence of vertices $(v_{1}, \dots, v_{k})$ of a graph $G$ is called a {\it dominating closed neighborhood sequence} if ${v_{1}, \dots, v_{k}}$ is a dominating set of $G$ an…

Tomescu's graph coloring conjecture for ℓ-connected graphs

Uniform Length Dominating Sequence Graphs

Tomescu's graph coloring conjecture for $ℓ$ -connected graphs