Consider a fixed connected, finite graph Γ and equip its vertices with weights pi which are non-negative integers. We show that there are a finite number of possibilities for the coefficients of the canonical cycle of a numerically Gorenstein surface singularity having Γ as the dual graph of the minimal resolution, the weights pi of the vertices being the arithmetic genera of the corresponding irreducible components. As a consequence we get that if Γ is not a cycle, then there are a finite number of possibilities of self-intersection numbers which one can attach to the vertices which are of valency ≥ 2, such that one gets the dual graph of the minimal resolution of a numerically Gorenstein surface singularity. Moreover, we describe precisel...
Locally analytically, any isolated double point occurs as a double cover of a smooth surface. It can...
AbstractA locally cyclic graph is a connected graph such that for each vertex the induced subgraph o...
AbstractLet K be a class of graphs. A pair (F,U) is a finite duality in K if U∈K, F is a finite set ...
AbstractWe explore the interplay between graph theory and the topology of isolated singularities of ...
Let K be a class of graphs. A pair (F,U) is a finite duality in K if U∈K, F is a finite set of graph...
AbstractWe explore the interplay between graph theory and the topology of isolated singularities of ...
A general strategy is given for the classification of graphs of rational surface singularities. For ...
A general strategy is given for the classification of graphs of rational surface singularities. For ...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
This thesis consists of two different topics that are not related. The thesis has two different and ...
This thesis consists of two different topics that are not related. The thesis has two different and ...
Given a finite connected graph G and specifications for a closed, con-nected pseudosurface, we chara...
Given any (not necessarily connected) combinatorial finite graph and any compact smooth $6$-manifold...
Locally analytically, any isolated double point occurs as a double cover of a smooth surface. It can...
AbstractA locally cyclic graph is a connected graph such that for each vertex the induced subgraph o...
AbstractLet K be a class of graphs. A pair (F,U) is a finite duality in K if U∈K, F is a finite set ...
AbstractWe explore the interplay between graph theory and the topology of isolated singularities of ...
Let K be a class of graphs. A pair (F,U) is a finite duality in K if U∈K, F is a finite set of graph...
AbstractWe explore the interplay between graph theory and the topology of isolated singularities of ...
A general strategy is given for the classification of graphs of rational surface singularities. For ...
A general strategy is given for the classification of graphs of rational surface singularities. For ...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
Given a finite connected graph G and specifications for a closed, connected pseudosurface, we charac...
This thesis consists of two different topics that are not related. The thesis has two different and ...
This thesis consists of two different topics that are not related. The thesis has two different and ...
Given a finite connected graph G and specifications for a closed, con-nected pseudosurface, we chara...
Given any (not necessarily connected) combinatorial finite graph and any compact smooth $6$-manifold...
Locally analytically, any isolated double point occurs as a double cover of a smooth surface. It can...
AbstractA locally cyclic graph is a connected graph such that for each vertex the induced subgraph o...
AbstractLet K be a class of graphs. A pair (F,U) is a finite duality in K if U∈K, F is a finite set ...