Graph Coloring Enumeration is a combinatorial counting method that systematically determines the number of valid vertex colorings of a graph using a given number of colors, accounting for adjacency constraints through inclusion-exclusion principles.
25
Publications
654
Citations
49
Authors
32
Institutions
Publications per year
2017–2026
3
Publications
25
Michael Albert, Alan Frieze, Bruce Reed · The Electronic Journal of Combinatorics · 1995 · 90 citations · Full text
Jin Xu · IEEE Transactions on Neural Networks and Learning Systems · 2016 · 72 citations
1–5 of 25
Authors
49
- DG
3
h-index
- EAEkaterina A. Vassilieva
Laboratoire d'Informatique de l'École Polytechnique, France
2 publications · 39 citations
2
h-index
- KB
2
h-index
- AB
2
h-index
- JX
1
h-index
1–5 of 49
Institutions
32
Peking University
Beijing, China
4 h-index
5 publications
167 citations
Laboratoire d'Informatique de l'École Polytechnique
Palaiseau, France
2 h-index
2 publications
39 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
2 publications
96 citations
Arizona State University
Tempe, United States
2 h-index
3 publications
31 citations
Chalmers University of Technology
Gothenburg, Sweden
2 h-index
2 publications
65 citations
IIT@MIT
Cambridge, United States
2 h-index
2 publications
78 citations
Royal Holloway University of London
Egham, United Kingdom
1 h-index
1 publications
36 citations
University of Memphis
Memphis, United States
1 h-index
1 publications
16 citations
1–8 of 32
Venues
- Discrete Mathematics
2 publications · 26 citations
2
h-index
- The Electronic Journal of Combinatorics
2 publications · 110 citations
2
h-index
- Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06
Conference · 1 publications · 18 citations
1
h-index
- IEEE Transactions on Neural Networks and Learning Systems
1 publications · 72 citations
1
h-index
- Journal of Mathematical Sciences and Modelling
1 publications · 11 citations
1
h-index
1–5