272 citations · 515 across the 52 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2024
Higher-rank trees arising from polyhedral graphs
David Pask
We introduce a new family of higher-rank graphs, whose construction was inspired by the graphical techniques of Lambek \cite{Lambek} and Johnstone \cite{Johnstone} used for monoid…
math.CO2004★ 17 cited
Fundamental groupoids of k-graphs
David Pask, John Quigg, Iain Raeburn
k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop a theo…