Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Ryan Odeneal"'
We find all maximal linklessly embeddable graphs of order up to 11, and verify that for every graph $G$ of order 11 either $G$ or its complement $cG$ is intrinsically linked. We give an example of a graph $G$ of order 11 such that both $G$ and $cG$ a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f151fbb4419ef4cdd816727f1fe6de40
http://arxiv.org/abs/2108.12946
http://arxiv.org/abs/2108.12946
Autor:
Ryan Odeneal, Andrei Pavelescu
Publikováno v:
Involve 13, no. 5 (2020), 829-843
We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor.
13 pages, 7 figures
13 pages, 7 figures
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::219264b542a286bda8553ed6839e7c97
https://projecteuclid.org/euclid.involve/1608606191
https://projecteuclid.org/euclid.involve/1608606191