On Weisfeiler-Leman invariance: subgraph counts and related graph properties

DOI10.1007/978-3-030-25027-0_8OpenAlexW3021120679MaRDI QIDQ5919354

Johannes Köbler, Oleg Verbitsky, V. Arvind, Frank Fuhlbrück

Publication date: 30 January 2020

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.04801

zbMATH Keywords

subgraph countsWeisfeiler-Leman algorithmisomorphism and similarity of graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

On Weisfeiler-Leman invariance: subgraph counts and related graph properties ⋮ The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs

This page was built for publication: On Weisfeiler-Leman invariance: subgraph counts and related graph properties