The Complexity of Counting Edge Colorings for Simple Graphs

by   Jin-Yi Cai, et al.

We prove #P-completeness results for counting edge colorings on simple graphs. These strengthen the corresponding results on multigraphs from [4]. We prove that for any κ≥ r ≥ 3 counting κ-edge colorings on r-regular simple graphs is #P-complete. Furthermore, we show that for planar r-regular simple graphs where r ∈{3, 4, 5} counting edge colorings with ąp̨p̨ą colors for any κ≥ r is also #P-complete. As there are no planar r-regular simple graphs for any r > 5, these statements cover all interesting cases in terms of the parameters (κ, r).


page 1

page 2

page 3

page 4


Counting Maximum Matchings in Planar Graphs Is Hard

Here we prove that counting maximum matchings in planar, bipartite graph...

Counting Polygon Triangulations is Hard

We prove that it is #P-complete to count the triangulations of a (non-si...

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs

We consider a natural restriction of the List Colouring problem: k-Regul...

Counting perfect matchings and the eight-vertex model

We study the approximation complexity of the partition function of the e...

Enumeration of regular graphs by using the cluster in high efficiency

In this note, we proposed a method to enumerate regular graphs on the cl...

The Complexity of Approximately Counting Retractions to Square-Free Graphs

A retraction is a homomorphism from a graph G to an induced subgraph H o...

A Complete List of All Convex Polyhedra Made by Gluing Regular Pentagons

We give a complete description of all convex polyhedra whose surface can...