Exact Distance Colouring in Trees

As a first result towards the 1-2-3 Conjecture, Karo´ nski, Luczak and Thomason proved that there is a set W of 183 real weights such that any graph with no isolated edge admits

† Supported by the Ministry of Science and Technology of Spain, and the European Regional Development Fund (ERDF) under project-BFM-2002-00412 and by the Catalan Research Council

Knowing an algorithm for edges coloring of a 3-regular graph called cubic, without isthmus, we know how to find the chromatic number of any graph.. Indeed, we explain how

We consider sets of words (sequences of symbols) and their corresponding generating functions to get precise average case analysis (here expected value and variance) of

Since there are no binary trees with an even number of vertices, it would perhaps be useful to consider inead binary trees with k leaves (a leaf being a vertex without a

We use our result to prove that the scaling limit of finite variance Galton–Watson trees conditioned on the number of nodes whose out-degree lies in a given set is the

The main tool that will enable us to use names to establish lower bounds for the rotation distance is a binary relation that provides a description of the shape of a tree in terms

Reducing the Number of Binary Splits, in Decision Tree Induction, by means of an Hierarchical Classification. Israël-César Lerman, Joaquim