Geodesic

Volume 17 (2015-2016) no. 2

Sommaire

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