Geodesic

Sommaire du Fascicule no. 1

ICGT 2018

A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions
On Weakly Distinguishing Graph Polynomials
FPT algorithms to recognize well covered graphs
On Stronger Types of Locating-dominating Codes
Parameterized Complexity of Equitable Coloring
The 2-domination and Roman domination numbers of grid graphs
Characterising and recognising game-perfect graphs
Computing metric hulls in graphs
New Bounds for the Dichromatic Number of a Digraph
Bisplit graphs satisfy the Chen-Chv\'atal conjecture
Stable gonality is computable
Alternating Hamiltonian cycles in $2$-edge-colored multigraphs
On the End-Vertex Problem of Graph Searches
The maximum number of $P_\ell$ copies in $P_k$-free graphs
Clustered Spanning Tree - Conditions for Feasibility
Cayley graphs of basic algebraic structures

Sommaire du Fascicule no. 2

Permutation Patters 2018

Expected size of a tree in the fixed point forest
A code for square permutations and convex permutominoes
Classical pattern distributions in $\mathcal{S}_{n}(132)$ and $\mathcal{S}_{n}(123)$
Consecutive Patterns in Inversion Sequences
Uniquely-Wilf classes
On the number of pancake stacks requiring four flips to be sorted
Enumeration of super-strong Wilf equivalence classes of permutations in the generalized factor order
Cyclic permutations avoiding pairs of patterns of length three
The undecidability of joint embedding and joint homomorphism for hereditary graph classes
Prolific Compositions
Statistics on Linear Chord Diagrams

Sommaire du Fascicule no. 3

Solving Two Conjectures regarding Codes for Location in Circulant Graphs
Binding Number, Toughness and General Matching Extendability in Graphs
On the maximum number of minimum total dominating sets in forests
$K_{1,3}$-covering red and blue points in the plane
Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words
On the insertion of n-powers
Packing coloring of generalized Sierpinski graphs
Packing chromatic vertex-critical graphs
Slimness of graphs
Bounds for the smallest $k$-chromatic graphs of given girth
Some results on the palette index of graphs
Exact values for three domination-like problems in circular and infinite grid graphs of small height
Number of orbits of Discrete Interval Exchanges
The agreement distance of rooted phylogenetic networks
Non-crossing paths with geographic constraints
Consecutive patterns in restricted permutations and involutions
Planar 3-SAT with a Clause/Variable Cycle
Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models
Efficient enumeration of solutions produced by closure operations
On-line algorithms for multiplication and division in real and complex numeration systems
On the multipacking number of grid graphs
The Adaptive sampling revisited
Backbone colouring and algorithms for TDMA scheduling
Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles

Sommaire du Fascicule no. 4

Constrained ear decompositions in graphs and digraphs
A note on the convexity number for complementary prisms
On almost hypohamiltonian graphs
Extremal properties of flood-filling games
Super edge-connectivity and matching preclusion of data center networks
On cordial labeling of hypertrees
$(2/2/3)$-SAT problem and its applications in dominating set problems
Fractional matching preclusion for generalized augmented cubes
On the centroid of increasing trees
Structure of conflict graphs in constraint alignment problems and algorithms
Embeddings of 3-connected 3-regular planar graphs on surfaces of non-negative Euler characteristic
New results on classical and quantum counter automata
Monochromatic loose paths in multicolored $k$-uniform cliques
Proofs of Conjectures about Pattern-Avoiding Linear Extensions
On the inducibility of small trees
An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth
Generalized Petersen graphs and Kronecker covers
Symmetry Properties of Nested Canalyzing Functions
Power domination in maximal planar graphs