# Discrete Applied Mathematics

Discrete Applied Mathematics > 2000 > 98 > 3 > 219-225

Discrete Applied Mathematics > 2000 > 98 > 3 > 191-207

^{k}of G is the graph with the same vertex set as G where two vertices are adjacent iff their distance is at most k in G. In this paper we prove that every LexBFS-ordering of a distance-hereditary graph is both a common perfect elimination ordering of all even powers and a common semi-simplicial ordering of all powers of this graph. Moreover, we characterize...

Discrete Applied Mathematics > 2000 > 98 > 3 > 227-235

Discrete Applied Mathematics > 2000 > 98 > 3 > 255-263

Discrete Applied Mathematics > 2000 > 98 > 3 > 173-190

Discrete Applied Mathematics > 2000 > 98 > 3 > 265-274

Discrete Applied Mathematics > 2000 > 98 > 3 > 209-217

^{5}w

_{i}) time algorithm, which is based on solving optimally a related problem where a maximal set of early jobs is to be determined.

Discrete Applied Mathematics > 2000 > 98 > 3 > 237-254

Discrete Applied Mathematics > 2000 > 99 > 1-3 > 251-259

Discrete Applied Mathematics > 2000 > 99 > 1-3 > 443-454

^{n}->{1,-1}

^{s}, such that every element in {1,-1}

^{s}has the same probability to occur when t arbitrary input variables are fixed by an adversary and the remaining n-t variables are assigned -1 or 1 uniformly and independently. A basic problem is to find the largest possible t given n and s such that an (n,s,t)-resilient...

Discrete Applied Mathematics > 2000 > 99 > 1-3 > 39-54

Discrete Applied Mathematics > 2000 > 99 > 1-3 > 229-244

Discrete Applied Mathematics > 2000 > 99 > 1-3 > 13-21

Discrete Applied Mathematics > 2000 > 99 > 1-3 > 169-181

_{k}(H) of a graph H has all length-k paths of H as vertices; two such vertices are adjacent in the new graph if their union forms a path or cycle of length k+1 in H, and if the common edges of both paths form a path of length k-1. In this paper we give a (nonpolynomial) recognition algorithm for k-path graphs, for every integer k>=2. The algorithm runs in polynomial time...

Discrete Applied Mathematics > 2000 > 99 > 1-3 > 245-249

Discrete Applied Mathematics > 2000 > 99 > 1-3 > 209-227

Discrete Applied Mathematics > 2000 > 99 > 1-3 > 401-411

_{3}are equivalent to the bicubic graphs of girth >=6. They are reducible to the configuration 7

_{3}, the Fano-Heawood-graph F, i.e. the projective plane of order 2 by means of a Martinetti-like procedure.

Discrete Applied Mathematics > 2000 > 99 > 1-3 > 331-338

_{3}for v=<18 and triangle-free configurations for v=<21 together with some statistics about some properties of the structures like transitivity, self-duality or self-polarity.