Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Kieran Clancy"'
Publikováno v:
Journal of Graph Algorithms and Applications. 23:135-166
We present a new heuristic method for minimising crossings in a graph. The method is based upon repeatedly solving the so-called {\em star insertion problem} in the setting where the combinatorial embedding is fixed, and has several desirable charact
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ac2a63e62e18b3ef0225a35b3a37593
https://doi.org/10.7155/jgaa.00487
https://doi.org/10.7155/jgaa.00487
Publikováno v:
Scopus-Elsevier
We present, to the best of the authors' knowledge, all known results for the (planar) crossing numbers of specific graphs and graph families. The results are separated into various categories; specifically, results for general graph families, results
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5bfeccd9a163fb0e1ce33e851597a0dd
We show that no cubic graphs of order 26 have crossing number larger than 9, which proves a conjecture of Ed Pegg Jr and Geoffrey Exoo that the smallest cubic graphs with crossing number 11 have 28 vertices. This result is achieved by first eliminati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f3cca9a979cd8e9246a787c8bd9aeb5
http://arxiv.org/abs/1804.10336
http://arxiv.org/abs/1804.10336