Word-representability conjecture for 5-regular circulant graphs
Let be a 5-regular circulant graph.
Word-representability conjecture. Every 5-regular circulant graph is word-representable.
The paper establishes word-representability for certain subclasses of 5-regular circulant graphs and poses this conjecture as a broader goal for future work.
References
Primary source
Suchanda Roy and Ramesh Hariharasubramanian, “On the Word-Representability of 5-Regular Circulant Graphs”, arXiv:2512.05480 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.