Geodesic

Volume 19 (2017-2018) no. 3

Sommaire

Post-surjectivity and balancedness of cellular automata over groups
Stammering tableaux
Tight Euler tours in uniform hypergraphs - computational aspects
Refined Enumeration of Corners in Tree-like Tableaux
Inkdots as advice for finite automata
Irreversible 2-conversion set in graphs of bounded degree
Binary Codes and Period-2 Orbits of Sequential Dynamical Systems
Tight upper bound on the maximum anti-forcing numbers of graphs
On path-cycle decompositions of triangle-free graphs
Circular Separation Dimension of a Subclass of Planar Graphs
A sufficient condition for a balanced bipartite digraph to be hamiltonian
Witness structures and immediate snapshot complexes
Periodic balanced binary triangles
Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps
Parabolic Catalan numbers count flagged Schur functions and their appearances as type A Demazure characters (key polynomials)
Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts
Three matching intersection property for matching covered graphs