Counting Partitions of Graphs

DOI10.1007/978-3-642-35261-4_26zbMath1260.68176OpenAlexW2268647895MaRDI QIDQ4909540

Miki Hermann, Mayssam Mohammadi Nevisi, Pavol Hell

Publication date: 21 March 2013

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_26

zbMATH Keywords

partitionspolynomial algorithmsdichotomycounting problems\#P-completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Counting \(4 \times 4\) matrix partitions of graphs ⋮ Counting List Matrix Partitions of Graphs

This page was built for publication: Counting Partitions of Graphs