Displaying similar documents to “Limit trees and generic discriminants of minimal surface singularities”

Equisingular generic discriminants and Whitney conditions

Eric Dago Akéké (2008)

Annales de la faculté des sciences de Toulouse Mathématiques

Similarity:

The purpose of this article is to show that are satisfied for complex analytic families of normal surface singularities for which the are . According to J. Briançon and J. P. Speder the constancy of the topological type of a family of surface singularities does not imply Whitney conditions in general. We will see here that for a family of these two equisingularity conditions are equivalent.

A combinatorial approach to singularities of normal surfaces

Sandro Manfredini (2003)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

Similarity:

In this paper we study generic coverings of ℂ 2 branched over a curve s.t. the total space is a normal analytic surface, in terms of a graph representing the monodromy of the covering, called monodromy graph. A complete description of the monodromy graphs and of the local fundamental groups is found in case the branch curve is { x n = y m } (with n ≤ m ) and the degree of the cover is equal to n or n - 1 .

Minimum vertex ranking spanning tree problem for chordal and proper interval graphs

Dariusz Dereniowski (2009)

Discussiones Mathematicae Graph Theory

Similarity:

A vertex k-ranking of a simple graph is a coloring of its vertices with k colors in such a way that each path connecting two vertices of the same color contains a vertex with a bigger color. Consider the minimum vertex ranking spanning tree (MVRST) problem where the goal is to find a spanning tree of a given graph G which has a vertex ranking using the minimal number of colors over vertex rankings of all spanning trees of G. K. Miyata et al. proved in [NP-hardness proof and an approximation...