The generalized road coloring problem and periodic digraphs

From MaRDI portal
Publication:429736

DOI10.1007/S00200-010-0135-ZzbMATH Open1242.05107arXiv0903.0192OpenAlexW2053812281MaRDI QIDQ429736FDOQ429736


Authors: Ph. Feinsilver, G. Budzban Edit this on Wikidata


Publication date: 20 June 2012

Published in: Applicable Algebra in Engineering, Communication and Computing, Semigroup Forum (Search for Journal in Brave)

Abstract: A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman's algorithm. Algebraic properties of periodic, strongly connected digraphs are studied in the semigroup context. An algebraic condition which characterizes periodic, strongly connected digraphs is determined in the context of periodic Markov chains.


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




Recommendations




Cites Work


Cited In (10)





This page was built for publication: The generalized road coloring problem and periodic digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429736)