The Maximal Subgroups and the Complexity of the Flow Semigroup of Finite (Di)graphs

Gábor Horváth, Chrystopher Nehaniv, Károly Podoski

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)
100 Downloads (Pure)

Fingerprint

Dive into the research topics of 'The Maximal Subgroups and the Complexity of the Flow Semigroup of Finite (Di)graphs'. Together they form a unique fingerprint.

Mathematics