Abstract
For various connected simple graphs G , we extend the table of diagonal graph Ramsey numbers R ( G , G ) in ‘ An Atlas of Graphs .’ This is accomplished by first converting the calculation of R ( G , G ) into a satisfiability problem in propositional logic. Mathematical arguments and scientific computing are then used to calculate R ( G , G ) .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Electronic Journal of Graph Theory and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
