Old Web
Exponentially many Z5-colorings in simple planar graphs
2020
Abstract Every planar simple graph with n vertices has at least 2 n / 9 Z 5 -colorings.
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
10
References
1
Citations
NaN
KQI