48 citations · 71 across the 12 of their papers we have counts for
12 papers
Cubic graphs and related triangulations on orientable surfaces
Wenjie Fang, Mihyun Kang, Michael Moßhammer +1
Let be the orientable surface of genus . We show that the number of vertex-labelled cubic multigraphs embeddable on with vertices is asymptoti…
Characterisation of symmetries of unlabelled triangulations and its applications
Mihyun Kang, Philipp Sprüssel
We give a full characterisation of the symmetries of unlabelled triangulations and derive a constructive decomposition of unlabelled triangulations depending on their symmetries. A…
Locally finite graphs with ends: a topological approach. III. Fundamental group and homology
Reinhard Diestel, Philipp Sprüssel
This paper is the last part of a comprehensive survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends…
Strongly maximal matchings in infinite weighted graphs
Ron Aharoni, Eli Berger, Agelos Georgakopoulos +1
Given an assignment of weights w to the edges of a graph G, a matching M in G is called strongly w-maximal if for any matching N the sum of weights of the edges in N\M is at most t…
Perfect matchings in r-partite r-graphs
Ron Aharoni, Agelos Georgakopoulos, Philipp Sprüssel
Let H be an r-partite r-graph, all of whose sides have the same size n. Suppose that there exist two sides of H, each satisfying the following condition: the degree of each legal (…
The Max-Flow Min-Cut Theorem for Countable Networks
Ron Aharoni, Eli Berger, Agelos Georgakopoulos +2
We prove a strong version of the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are "orthogonal" to each other…