关于无$Oct_{1}^{+}$图和无$Oct_{2}^{+}$图的注记
A note on $Oct_{1}^{+}$-free graphs and $Oct_{2}^{+}$-free graphs
摘要:
设$Oct_{1}^{+}$和$Oct_{2}^{+}$分别为八面体顶点3-分裂得到的平面图和非平面图.对于$Oct_{1}^{+}$,我们证明了一个4-连通图是$Oct_{1}^{+}$ -free的当且仅当它是$C_{6}^{2}$,$C_{2k+1}^{2}$ $(k \geq 2)$或它是由$C_{5}^{2}$通过重复4-分裂顶点得到的.我们还证明了一个平面图是$Oct_{1}^{+}$ -free的当且仅当它是从$\{K_{1}, K_{2} ,K_{3}\} \cup \mathscr{K} \cup \{Oct,L_{5} \}$开始重复取0-,1-,2-和而构造的,其中$\mathscr{K}$是由重复取$K_{4}$的特殊3-和而得到的图的集合.对于$Oct_{2}^{+}$,我们证明了一个4-连通图是$Oct_{2}^{+}$ -free的当且仅当它是平面的,$C_{2k+1}^{2}$ $(k \geq 2)$,$L(K_{3,3})$或它是由$C_{5}^{2}$通过重复4-分裂顶点得到的.
英文摘要:
Let $Oct_{1}^{+}$ and $Oct_{2}^{+}$ be the planar and non-planar graphs that obtained from the Octahedron by 3-splitting a vertex respectively. For $Oct_{1}^{+}$, we prove that a 4-connected graph is $Oct_{1}^{+}$-free if and only if it is $C_{6}^{2}$, $C_{2k+1}^{2}$ $(k \geq 2)$ or it is obtained from $C_{5}^{2}$ by repeatedly 4-splitting vertices. We also show that a planar graph is $Oct_{1}^{+}$-free if and only if it is constructed by repeatedly taking 0-, 1-, 2-sums starting from $\{K_{1}, K_{2} ,K_{3}\} \cup \mathscr{K} \cup \{Oct,L_{5} \}$, where $\mathscr{K}$ is the set of graphs obtained by repeatedly taking the special 3-sums of $K_{4}$. For $Oct_{2}^{+}$, we prove that a 4-connected graph is $Oct_{2}^{+}$-free if and only if it is planar, $C_{2k+1}^{2}$ $(k \geq 2)$, $L(K_{3,3})$ or it is obtained from $C_{5}^{2}$ by repeatedly 4-splitting vertices.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。