Counting partitions of graphs

DOI10.1007/978-3-642-35261-4_26zbMATH Open1260.68176OpenAlexW2268647895MaRDI QIDQ4909540FDOQ4909540

Authors: 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

Recommendations

• Counting List Matrix Partitions of Graphs
• Counting \(4 \times 4\) matrix partitions of graphs
• The complexity of partition functions
• Automata, Languages and Programming
• Counting homomorphisms and partition functions

zbMATH Keywords

partitionsdichotomypolynomial algorithmscounting problems\#P-completeness

Mathematics Subject Classification ID

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

Cited In (9)

• Computing the partition function for graph homomorphisms with multiplicities
• A recurrence for counting graphical partitions
• Countable homogeneous multipartite graphs
• Counting partitions of a fixed genus
• Counting \(4 \times 4\) matrix partitions of graphs
• Title not available (Why is that?)
• Counting List Matrix Partitions of Graphs
• Title not available (Why is that?)
• Digraph matrix partitions and trigraph homomorphisms

This page was built for publication: Counting partitions of graphs

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