




























A complete structural characterization of graphs with no $K_{3,4}$ minor is obtained, and the following consequences are established. Every $4$-connected non-planar graph with at least seven vertices and minimum degree at least five contains both $K_{3,4}$ and $K_6^-$ as minors, thereby proving a conjecture of Kawarabayashi and Maharry in a strengthened form. Moreover, every $4$-connected graph with no $K_{3,4}$ minor is hamiltonian-connected, extending a theorem of Thomassen, and admits an embedding on the torus.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。