112 citations · 255 across the 57 of their papers we have counts for
20 papers · 1 filter
The Complement of the Djokovic-Winkler Relation
Marc Hellmuth, Bruno J. Schmidt, Guillaume E. Scholz +1
The Djoković-Winkler relation is a binary relation defined on the edge set of a given graph that is based on the distances of certain vertices and which plays a prominent role…
On a generalization of median graphs: -median graphs
Marc Hellmuth, Sandhya Thekkumpadan Puthiyaveedu
Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. To be more for…
Injective split systems
M. Hellmuth, K. T. Huber, V. Moulton +2
A split system on a finite set , , is a set of bipartitions or splits of which contains all splits of the form , . To any such…
Resolving Prime Modules: The Structure of Pseudo-cographs and Galled-Tree Explainable Graphs
Marc Hellmuth, Guillaume E. Scholz
The modular decomposition of a graph is a natural construction to capture key features of in terms of a labeled tree whose vertices are labeled as "series" (), "…
From Modular Decomposition Trees to Level-1 Networks: Pseudo-Cographs, Polar-Cats and Prime Polar-Cats
Marc Hellmuth, Guillaume E. Scholz
The modular decomposition of a graph is a natural construction to capture key features of in terms of a labeled tree whose vertices are labeled as "series" (), "…
Planar Median Graphs and Cubesquare-Graphs
Carsten R. Seemann, Vincent Moulton, Peter F. Stadler +1
Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. In this paper…