7 citations · 19 across the 5 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2011
Digraph Complexity Measures and Applications in Formal Language Theory
Hermann Gruber
We investigate structural complexity measures on digraphs, in particular the cycle rank. This concept is intimately related to a classical topic in formal language theory, namely t…
cs.DM2011★ 1 cited
Bounding the Feedback Vertex Number of Digraphs in Terms of Vertex Degrees
Hermann Gruber
The Turan bound is a famous result in graph theory, which relates the independence number of an undirected graph to its edge density. Also the Caro-Wei inequality, which gives a mo…
cs.DM2010
On Balanced Separators, Treewidth, and Cycle Rank
Hermann Gruber
We investigate relations between different width parameters of graphs, in particular balanced separator number, treewidth, and cycle rank. Our main result states that a graph with…