Geodesic

Sommaire du Fascicule no. 1

A note on a recent attempt to improve the Pin-Frankl bound
Output sensitive algorithms for covering many points
Parameterized complexity of synchronization and road coloring
Graphs with large disjunctive total domination number
Extending a perfect matching to a Hamiltonian cycle
An efficient certificateless aggregate signature scheme for vehicular ad-hoc networks
Maximum difference about the size of optimal identifying codes in graphs differing by one vertex
On substitution tilings of the plane with n-fold rotational symmetry
How often should you clean your room?
Intervals and factors in the Bruhat order
Snarks with total chromatic number 5
On the Hausdorff measure of regular ω-languages in Cantor space
A conjecture on the number of Hamiltonian cycles on thin grid cylinder graphs
Cost-effectiveness of algorithms
Connectivity of Fibonacci cubes, Lucas cubes and generalized cubes
Classification of skew translation generalized quadrangles, I
On the 1-2-3-conjecture
An approximability-related parameter on graphs―-properties and applications
Symmetric bipartite graphs and graphs with loops
Edge stability in secure graph domination
p-box: a new graph model
On probe 2-clique graphs and probe diamond-free graphs
Guarded subgraphs and the domination game
Avoider-enforcer star games
Bootstrapping and double-exponential limit laws
A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon
Ore-degree threshold for the square of a Hamiltonian cycle

Sommaire du Fascicule no. 2

The complexity of $P$4-decomposition of regular graphs and multigraphs
On graphs double-critical with respect to the colouring number
The game chromatic number of trees and forests
Disimplicial arcs, transitive vertices, and disimplicial eliminations
Packing Plane Perfect Matchings into a Point Set
The double competition multigraph of a digraph
Cubical coloring — fractional covering by cuts and semidefinite programming
Reducing the rank of a matroid
Improving Vertex Cover as a Graph Parameter
Some undecidable problems about the trace-subshift associated to a Turing machine
Classical Automata on Promise Problems
Minimum Number of Colors: the Turk’s Head Knots Case Study
On avoidance of patterns of the form σ-τ by words over a finite alphabet
A relation on 132-avoiding permutation patterns
Symmetries of Monocoronal Tilings
On the Dynamics of Systems of Urns

Sommaire du Fascicule no. 3

Traceability of locally hamiltonian and locally traceable graphs
The inapproximability for the $(0,1)$-additive number
The irregularity of two types of trees
Planar graphs with $\Delta \geq 7$ and no triangle adjacent to a $C_4$ are minimally edge and total choosable
Edge Disjoint Hamilton Cycles in Knödel Graphs
On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance
Arithmetic completely regular codes
Connected Tropical Subgraphs in Vertex-Colored Graphs
An extremal problem for a graphic sequence to have a realization containing every 2-tree with prescribed size
Rainbow eulerian multidigraphs and the product of cycles
Edge-partitioning graphs into regular and locally irregular components
A proof of Zhil'tsov's theorem on decidability of equational theory of epigroups
Statistics for 3-letter patterns with repetitions in compositions
Dendriform structures for restriction-deletion and restriction-contraction matroid Hopf algebras
Avoiding patterns in irreducible permutations
On the complexity of edge-colored subgraph partitioning problems in network optimization
Energy-optimal algorithms for computing aggregative functions in random networks
The complexity of deciding whether a graph admits an orientation with fixed weak diameter
Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights
Robust Wireless Sensor Network Deployment
Permutations of context-free, ET0L and indexed languages
Linear recognition of generalized Fibonacci cubes $Q_h(111)$