12 citations · 14 across the 2 of their papers we have counts for
5 papers · 1 filter
Uniformly connected graphs
Frank Göring, Tobias Hofmann, Manuel Streicher
In this article we investigate the structure of uniformly -connected and uniformly -edge-connected graphs. Whereas both types have previously been studied independent of each…
2.5-Connectivity: Unique Components, Critical Graphs, and Applications
Irene Heinrich, Till Heller, Eva Schmidt +1
If a biconnected graph stays connected after the removal of an arbitrary vertex and an arbitrary edge, then it is called 2.5-connected. We prove that every biconnected graph has a…
On the Mixed Connectivity Conjecture of Beineke and Harary
Sebastian S. Johann, Sven O. Krumke, Manuel Streicher
The conjecture of Beineke and Harary states that for any two vertices which can be separated by vertices and edges for but neither by vertices and edges…
Simultaneously Dominating all Spanning Trees of a Graph
Sebastian S. Johann, Sven O. Krumke, Manuel Streicher
We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning tr…
Hajós' cycle conjecture for small graphs
Irene Heinrich, Marco V. Natale, Manuel Streicher
Hajós' conjecture states that an Eulerian graph of order n can be decomposed into at most (n-1)/2 edge-disjoint cycles. We describe preprocessing steps, heuristics and integer prog…