Craig Timmons

collaborators

2 papers

math.CO2025

Forbidden subgraphs and complete partitions

John Byrne, Michael Tait, Craig Timmons

A graph is called an $(r, k)$ -graph if its vertex set can be partitioned into $r$ parts, each having at most $k$ vertices and there is at least one edge between any two parts. Let $…

math.CO2025

Chromatic and achromatic numbers of unitary addition Cayley graphs

Keenan Calhoun, YeÅim DemiroÄlu Karabulut, Vincent Pigno +1

Let $R$ be a ring. The unitary addition Cayley graph of $R$ , denoted $U (R)$ , is the graph with vertex $R$ , and two distinct vertices $x$ and $y$ are adjacent if and only…