5 citations · 17 across the 10 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2024
Gathering Information about a Graph by Counting Walks from a Single Vertex
Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky +1
We say that a vertex in a connected graph is decisive if the numbers of walks from of each length determine the graph rooted at up to isomorphism among all conn…
cs.DM2018★ 5 cited
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties
V. Arvind, Frank Fuhlbrück, Johannes Köbler +1
The -dimensional Weisfeiler-Leman algorithm (-WL) is a fruitful approach to the Graph Isomorphism problem. 2-WL corresponds to the original algorithm suggested by Weisfeiler…
cs.DM2013★ 4 cited
Circular-arc hypergraphs: Rigidity via Connectedness
Johannes Köbler, Sebastian Kuhnert, Oleg Verbitsky
A circular-arc hypergraph is a hypergraph admitting an arc ordering, that is, a circular ordering of the vertex set such that every hyperedge is an arc of consecutive ve…