Abstract
The paper attempts to classify 5-regular graphs according to their crossing numbers and with given number of vertices. In particular, it is shown that there exist no 5-regular graphs on 12 vertices with crossing number one. This together with a result in [2] imply that the minimum number of vertices in a 5-regular graph with girth three and crossing number one is 14.
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 callDisclaimer: 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.
