4 papers
Constructions of betweenness-uniform graphs from trees
David Hartman, Aneta Pokorná
Betweenness centrality is a measure of the importance of a vertex x inside a network based on the fraction of shortest paths passing through x. We study a blow-up construction that…
The independence number of HH-homogeneous graphs and a classification of MB-homogeneous graphs
Andrés Aranda, David Hartman
We show that the independence number of a countably infinite HH-homogeneous graph that does not contain the Rado graph as a spanning subgraph is finite and present a classification…
Regularity radius: Properties, approximation and a not a priori exponential algorithm
David Hartman, Milan Hladik
The radius of regularity sometimes spelled as the radius of nonsingularity is a measure providing the distance of a given matrix to the nearest singular one. Despite its possible a…
Morphism extension classes of countable -colored graphs
Andrés Aranda, David Hartman
In~\cite{Hartman:2014}, Hartman, Hubi\v cka and Ma\v sulović studied the hierarchy of morphism extension classes for finite -colored graphs, that is, undirected graphs without l…