
Short cycle covers of cubic graphs and intersecting 5circuits
A cycle cover of a graph is a collection of cycles such that each edge o...
read it

Graphs with the second and third maximum Wiener index over the 2vertex connected graphs
Wiener index, defined as the sum of distances between all unordered pair...
read it

Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions
We develop a framework for graph sparsification and sketching, based on ...
read it

A Note on Directed Treewidth
We characterise digraphs of directed treewidth one in terms of forbidden...
read it

Cyclebased formulations in Distance Geometry
The distance geometry problem asks to find a realization of a given simp...
read it

A generative, predictive model for menstrual cycle lengths that accounts for potential selftracking artifacts in mobile health data
Mobile health (mHealth) apps such as menstrual trackers provide a rich s...
read it

Periodhalving Bifurcation of a Neuronal Recurrence Equation
We study the sequences generated by neuronal recurrence equations of the...
read it
A Hamilton Cycle in the kSided Pancake Network
We present a Hamilton cycle in the ksided pancake network and four combinatorial algorithms to traverse the cycle. The network's vertices are coloured permutations π = p_1p_2⋯ p_n, where each p_i has an associated colour in {0,1,…, k1}. There is a directed edge (π_1,π_2) if π_2 can be obtained from π_1 by a "flip" of length j, which reverses the first j elements and increments their colour modulo k. Our particular cycle is created using a greedy minflip strategy, and the average flip length of the edges we use is bounded by a constant.
READ FULL TEXT
Comments
There are no comments yet.