Černý conjecture for edge-colored digraphs with few junctions
From MaRDI portal
Publication:510555
DOI10.1016/j.endm.2016.09.021zbMath1356.05051OpenAlexW2537138782WikidataQ122881531 ScholiaQ122881531MaRDI QIDQ510555
Andrzej P. Kisielewicz, Grech, Mariusz
Publication date: 13 February 2017
Full work available at URL: https://doi.org/10.1016/j.endm.2016.09.021
Formal languages and automata (68Q45) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)
Related Items
Synchronizing sequences for road colored digraphs, Preimage problems for deterministic finite automata
Cites Work