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.
Cite
CITATION STYLE
APA
Chia, G. L., & Gan, C. S. (2002). On crossing numbers of 5-regular graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2387, pp. 230–237). Springer Verlag. https://doi.org/10.1007/3-540-45655-4_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free