Simple Graphs of Order 12 and Minimum Degree 6 Contain K_6 Minors
arXiv:1910.11891 · doi:10.2140/involve.2020.13.829
Abstract
We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor.
13 pages, 7 figures
arXiv:1910.11891 · doi:10.2140/involve.2020.13.829
We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor.
13 pages, 7 figures