Geodesic

Volume 16 (2014) no. 3

Sommaire

Partitioning Harary graphs into connected subgraphs containing prescribed vertices
Detection number of bipartite graphs and cubic graphs
Generalized dynamic storage allocation
Toppling numbers of complete and random graphs
On the number of regular edge labelings
An algorithmic analysis of Flood-It and Free-Flood-It on graph powers
On the numbers of radial orderings of planar point sets
Cell-paths in mono- and bichromatic line arrangements in the plane
Determining pure discrete spectrum for some self-affine tilings
Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
Packing and covering the balanced complete bipartite multigraph with cycles and stars
Complexity of conditional colouring with given template
Oriented diameter and rainbow connection number of a graph
A four-sweep LBFS recognition algorithm for interval graphs
An exact algorithm for the generalized list T-coloring problem
On permutation complexity of fixed points of some uniform binary morphisms
Bounding the monomial index and (1,l)-weight choosability of a graph
Biased weak polyform achievement games
Genus distributions of cubic series-parallel graphs
Balancedness of subclasses of circular-arc graphs