Alternating colourings of the vertices of a regular polygon

DOI10.1017/S0004972719000157MaRDI QIDQ5232873zbMATH OpenOpenAlexFDO

Authors Shivani Singh, Yuliya Zelenyuk

Publication date 13 September 2019

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0004972719000157

zbMATH Keywords

alternatingBurnside's lemmacolouringnecklaceregular polygon

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Coloring of graphs and hypergraphs (05C15) Group actions on combinatorial structures (05E18) Arithmetic functions; related numbers; inversion formulas (11A25)

Recommendations

• ENUMERATING NECKLACES WITH TRANSITIONS
• Symmetric colorings of regular polygons.
• scientific article; zbMATH DE number 4132183
• scientific article; zbMATH DE number 1885146
• Counting symmetric colourings of the vertices of a regular polygon

Cites work

• An introduction to chromatic polynomials
• Counting symmetric bracelets
• Counting symmetric colourings of the vertices of a regular polygon
• scientific article; zbMATH DE number 3645097 (Why is no real title available?)
• On the Applications of Mobius Inversion in Combinatorial Analysis

Cited in

(2)

• ENUMERATING NECKLACES WITH TRANSITIONS
• Counting symmetric colourings of the vertices of a regular polygon

This page was built for publication: Alternating colourings of the vertices of a regular polygon

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