The square root of a digraph

DOI10.1016/S0021-9800(68)80079-1zbMath0167.22402MaRDI QIDQ5554172

Dennis P. Geller

Publication date: 1968

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

zbMATH Keywords

topology

Related Items (5)

Computing roots of graphs is hard ⋮ Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 ⋮ Characterization of n-path graphs and of graphs having \(n\)-th root ⋮ Square roots in finite full transformation semigroups ⋮ Linear-time algorithms for tree root problems

This page was built for publication: The square root of a digraph