Perfect 3-Colorings on 4-Regular Graph of Order 8
Sk Rabiul Islam, Sayantan Maity, Ashish Kumar Upadhyay
TL;DR
This paper investigates the structure and properties of perfect 3-colorings specifically on 4-regular graphs with 8 vertices, providing insights into their coloring configurations.
Contribution
It offers a detailed classification and analysis of perfect 3-colorings on a specific class of small, regular graphs, which was not previously fully characterized.
Findings
Identified all possible perfect 3-colorings on the given graphs.
Established conditions for the existence of such colorings.
Provided a complete enumeration of these colorings.
Abstract
We study the perfect -colorings on 4-regular graphs of order 8.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.