Small Snarks with Large Oddness

Electronic Journal Of Combinatorics

Robert Lukoťka¹ 

关键词: cubic graph;    snark;    oddness;    resistance;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

We estimate the minimum number of vertices of a cubic graph with given oddness and cyclic connectivity. We prove that a bridgeless cubic graph $G$ with oddness $\omega(G)$ other than the Petersen graph has at least $5.41\, \omega(G)$ vertices, and for eac

【 授权许可】

Others