3 citations · 4 across the 4 of their papers we have counts for
4 papers
Finite Vertex-colored Ultrahomogeneous Oriented Graphs
Irene Heinrich, Eda Kaja, Pascal Schweitzer
A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite bina…
Minimum Cycle Decomposition: A Constructive Characterization for Graphs of Treewidth Two with Node Degrees Two and Four
Irene Heinrich, Sven O. Krumke
Substantial efforts have been made to compute or estimate the minimum number of cycles needed to partition the edges of an Eulerian graph. We give an equivalent characteriza…
Counting Dominating Sets of Graphs
Irene Heinrich, Peter Tittmann
Counting dominating sets in a graph is closely related to the neighborhood complex of . We exploit this relation to prove that the number of dominating sets of a grap…
Large Values of the Clustering Coefficient
Michael Gentner, Irene Heinrich, Simon Jäger +1
A prominent parameter in the context of network analysis, originally proposed by Watts and Strogatz (Collective dynamics of `small-world' networks, Nature 393 (1998) 440-442), is t…