1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.CO2025
Reconstructing graphs and their connectivity using graphlets
David Hartman, Aneta Pokorná, Daniel Trlifaj +1
Graphlets are subgraphs rooted at a fixed vertex. The number of occurrences of graphlets aligned to a particular vertex, called graphlet degree sequence (gds), gives a topological…
math.CO2023
Structure of betweenness uniform graphs with low values of betweenness centrality
Babak Ghanbari, David Hartman, Vít Jelínek +3
This work deals with undirected graphs that have the same betweenness centrality for each vertex, so-called betweenness uniform graphs (or BUGs). The class of these graphs is not t…
math.CO2023★ 1 cited
Structural convergence and algebraic roots
David Hartman, Tomáš Hons, Jaroslav Nešetřil
Structural convergence is a framework for convergence of graphs by Nešetřil and Ossona de Mendez that unifies the dense (left) graph convergence and Benjamini-Schramm convergence.…