A quick way to verify if a graph is 3-colorable
From MaRDI portal
Publication:6633531
DOI10.1016/J.DAM.2024.07.039MaRDI QIDQ6633531
Author name not available (Why is that?)
Publication date: 6 November 2024
Published in: (Search for Journal in Brave)
No records found.
No records found.
This page was built for publication: A quick way to verify if a graph is 3-colorable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6633531)
