Number of cyclically irreducible words in the alphabet of a free group of finite rank

DOI10.1007/s10559-007-0076-0zbMath1142.68056OpenAlexW2002623566MaRDI QIDQ2480498

L. M. Koganov

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

zbMATH Keywords

chromatic polynomial of a graphcyclically irreducible wordproper wordWhitney formula for the chromatic polynomial of a simple cycle

Mathematics Subject Classification ID

Combinatorics on words (68R15) Coloring of graphs and hypergraphs (05C15) Free nonabelian groups (20E05)

Related Items (2)

Number of cyclically irreducible words in the alphabet of a free group of finite rank ⋮ Growth in free groups (and other stories) -- twelve years later

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Number of cyclically irreducible words in the alphabet of a free group of finite rank
• Branched coverings of riemann surfaces whose branch orders coincide with the multiplicity
• An introduction to chromatic polynomials

This page was built for publication: Number of cyclically irreducible words in the alphabet of a free group of finite rank