Yet another method of enumerating unmarked combinatorial objects

DOI10.1007/BF01240267MaRDI QIDQ1173770zbMATH OpenFDO

Authors A. A. Chernyak, Regina Iosifovna Tyshkevich

Publication date 25 June 1992

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01240267

zbMATH Keywords

Burnside lemmaenumeration methodPólya's theoremunmarked combinatorial objects

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Review text

This paper gives an enumeration method for unmarked combinatorial objects which is based on a direct application of the starting step of Pólya's theorem, the Burnside lemma and a solution of simple matrix equations.

Recommendations

• ECO:a methodology for the enumeration of combinatorial objects
• scientific article; zbMATH DE number 5606398
• scientific article; zbMATH DE number 5274220
• scientific article; zbMATH DE number 1028226

Cited in

(6)

• Recognition of split-graphic sequences
• Faster parameterized algorithms for deletion to split graphs
• Fast enumeration of combinatorial objects
• ECO:a methodology for the enumeration of combinatorial objects
• scientific article; zbMATH DE number 819115 (Why is no real title available?)
• Quadratic vertex kernel for split vertex deletion

This page was built for publication: Yet another method of enumerating unmarked combinatorial objects

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