
On Embedding De Bruijn Sequences by Increasing the Alphabet Size
The generalization of De Bruijn sequences to infinite sequences with res...
read it

A new proof of Grinberg Theorem based on cycle bases
Grinberg Theorem, a necessary condition only for planar Hamiltonian grap...
read it

An Efficient Generalized ShiftRule for the PreferMax De Bruijn Sequence
One of the fundamental ways to construct De Bruijn sequences is by using...
read it

CantorBernstein implies Excluded Middle
We prove in constructive logic that the statement of the CantorBernstei...
read it

On Regularity of MaxCSPs and MinCSPs
We study approximability of regular constraint satisfaction problems, i....
read it

The (2,k)connectivity augmentation problem: Algorithmic aspects
Durand de Gevigney and Szigeti <cit.> have recently given a minmax theo...
read it

To reorient is easier than to orient: an online algorithm for reorientation of graphs
We define an online (incremental) algorithm that, given a (possibly inf...
read it
A Cycle Joining Construction of the PreferMax De Bruijn Sequence
We propose a novel construction for the wellknown prefermax De Bruijn sequence, based on the cycle joining technique. We further show that the construction implies known results from the literature in a straightforward manner. First, it implies the correctness of the onion theorem, stating that, effectively, the reverse of prefermax is in fact an infinite De Bruijn sequence. Second, it implies the correctness of recently discovered shift rules for prefermax, prefermin, and their reversals. Lastly, it forms an alternative proof for the seminal FKMtheorem.
READ FULL TEXT
Comments
There are no comments yet.