Number of cyclically irreducible words in the alphabet of a free group of finite rank
From MaRDI portal
Publication:2480498
DOI10.1007/s10559-007-0076-0zbMath1142.68056MaRDI QIDQ2480498
Publication date: 31 March 2008
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-007-0076-0
chromatic polynomial of a graph; cyclically irreducible word; proper word; Whitney formula for the chromatic polynomial of a simple cycle
68R15: Combinatorics on words
05C15: Coloring of graphs and hypergraphs
20E05: Free nonabelian groups
Related Items
Growth in free groups (and other stories) -- twelve years later, Number of cyclically irreducible words in the alphabet of a free group of finite rank
Cites Work