Geodesic

Volume 13 (2011) no. 3

Sommaire

Nordhaus-Gaddum Type Results for Total Domination
The largest singletons in weighted set partitions and its applications
On packing of two copies of a hypergraph
On the number of maximal independent sets in a graph
On the complexity of vertex-coloring edge-weightings
On the Book Thickness of k-Trees
On the number of factors in codings of three interval exchange
The Variance of the Profile in Digital Search Trees
Digital search trees with m trees: Level polynomials and insertion costs
New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree
8-star-choosability of a graph with maximum average degree less than 3