J. Sawada

activity

20062026

most citedOn Prefix Normal Words and Prefix Normal Forms

19 citations · 73 across the 21 of their papers we have counts for

collaborators

Showing 2022Show all

3 papers · 1 filter

math.CO2022★ 1 cited

Vertex-critical $(P_{3} + ℓ P_{1})$ -free and vertex-critical (gem, co-gem)-free graphs

Tala Abuadas, Ben Cameron, Chính T. Hoàng +1

A graph $G$ is $k$ -vertex-critical if $χ (G) = k$ but $χ (G - v) < k$ for all $v \in V (G)$ where $χ (G)$ denotes the chromatic number of $G$ . We show that there are only finitely many $k$ -cr…

cs.DS2022

Cut-Down de Bruijn Sequences

Ben Cameron, Aysu Gündoğan, Joe Sawada

A cut-down de Bruijn sequence is a cyclic string of length $L$ , where $1 \leq L \leq k^{n}$ , such that every substring of length $n$ appears at most once. Etzion [Theor. Comp. Sci 44…

cs.DS2022

Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan

Ben Cameron, Aaron Grubb, Joe Sawada

We consider the problem of listing all spanning trees of a graph $G$ such that successive trees differ by pivoting a single edge around a vertex. Such a listing is called a "pivot…

Vertex-critical (P3​+ℓP1​)-free and vertex-critical (gem, co-gem)-free graphs

Cut-Down de Bruijn Sequences

Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan

Vertex-critical $(P_{3} + ℓ P_{1})$ -free and vertex-critical (gem, co-gem)-free graphs