research
∙
06/07/2022
Vertex-critical (P_3+ℓ P_1)-free and vertex-critical (gem, co-gem)-free graphs
A graph G is k-vertex-critical if χ(G)=k but χ(G-v)<k for all v∈ V(G) wh...
share
research
∙
05/05/2022
Cut-Down de Bruijn Sequences
A cut-down de Bruijn sequence is a cyclic string of length L, where 1 ≤ ...
research
∙
02/03/2022
Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan
We consider the problem of listing all spanning trees of a graph G such ...
research
∙
08/20/2021
A Pivot Gray Code Listing for the Spanning Trees of the Fan Graph
We use a greedy strategy to list the spanning trees of the fan graph, F_...
research
∙
05/08/2021
Inside the Binary Reflected Gray Code: Flip-Swap Languages in 2-Gray Code Order
A flip-swap language is a set S of binary strings of length n such that ...
research
∙
03/16/2021
A Hamilton Cycle in the k-Sided Pancake Network
We present a Hamilton cycle in the k-sided pancake network and four comb...
research
∙
10/15/2020
Efficient constructions of the Prefer-same and Prefer-opposite de Bruijn sequences
The greedy Prefer-same de Bruijn sequence construction was first present...
research
∙
06/30/2020
Dichotomizing k-vertex-critical H-free graphs for H of order four
For k ≥ 3, we prove (i) there is a finite number of k-vertex-critical (P...
research
∙
05/04/2020
Investigating the discrepancy property of de Bruijn sequences
The discrepancy of a binary string refers to the maximum (absolute) diff...
research
∙
03/05/2020
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
A prefix normal word is a binary word with the property that no substrin...
research
∙
02/16/2018