Yet another method of enumerating unmarked combinatorial objects

DOI10.1007/BF01240267zbMath0747.05011MaRDI QIDQ1173770

A. A. Chernyak, Regina I. Tyshkevich

Publication date: 25 June 1992

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

enumeration methodBurnside lemmaPólya's theoremunmarked combinatorial objects

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15)

Related Items (3)

Quadratic vertex kernel for split vertex deletion ⋮ Recognition of split-graphic sequences ⋮ Faster parameterized algorithms for deletion to split graphs

Cites Work

• Unnamed Item

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