Counting colorings of a regular graph
From MaRDI portal
Publication:2345527
DOI10.1007/s00373-013-1403-zzbMath1312.05049arXiv1205.2718MaRDI QIDQ2345527
Publication date: 22 May 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.2718
Related Items
On extension of regular graphs, Notes on use of generalized entropies in counting, Extremal colorings and independent sets
Cites Work
- Unnamed Item
- Backtrack: An O(1) expected time algorithm for the graph coloring problem
- An upper bound for the number of independent sets in regular graphs
- Legal coloring of graphs
- Independent sets in regular graphs and sum-free subsets of finite groups
- Some corollaries of a theorem of Whitney on the chromatic polynomial
- An Entropy Approach to the Hard-Core Model on Bipartite Graphs
- Maximizing the number of q -colorings
- Extremal Combinatorics
- The Bipartite Swapping Trick on Graph Homomorphisms
- The Number of Independent Sets in a Regular Graph
- A theoretical analysis of backtracking in the graph coloring problem
- On weighted graph homomorphisms
- Maximizing H‐Colorings of a Regular Graph