Generalizations of bounds on the index of convergence to weighted digraphs

Or equivalently what are the minimal families F such that the class of graphs that do not contain any graph in F as an induced subgraph has bounded chromatic number.. Since cliques

After controlling for multiple testing, the following discordant site associations were signi ficant at α = 0.05: oral and pharyngeal cancer and FH of laryngeal cancer (OR =

In addition, while Filotti, Miller and Reif [12] have shown that the question whether an undirected graph has an embedding on a fixed sur- face has polynomial time algorithm,

We give purely graph theoretic parame- ters (i.e., without reference to strings) that are exactly (respectively, asymp- totically) equivalent to readability for trees (respectively, C

We prove a general upper bound on the neighbour-distinguishing index of a digraph in Section 3, and study various classes of digraphs in Section 4.. Concluding remarks are given

The River Exploratory behavior guides the vehicle to produce a data set that is a good representation of the depth across the entire width of the river.. The behavior

The signifi- cant benefit of our two new bounds is that each of them turns out to be linear in the number of nodes in various classes of weighted digraphs, whereas Hartmann

Unite´ de recherche INRIA Rocquencourt, Domaine de Voluceau, Rocquencourt, BP 105, 78153 LE CHESNAY Cedex Unite´ de recherche INRIA Sophia-Antipolis, 2004 route des Lucioles, BP