期刊论文详细信息
Electronic Journal Of Combinatorics | |
Measures of Edge-Uncolorability of Cubic Graphs | |
M. A. Fiol1  | |
关键词: Cubic graph; Tait coloring; Snark; Boole coloring; Berge'; s conjecture; Tutte'; s 5-flow conjecture; | |
DOI : | |
学科分类:离散数学和组合数学 | |
来源: Electronic Journal Of Combinatorics | |
【 摘 要 】
There are many hard conjectures in graph theory, like Tutte's 5-flow conjecture, and the $5$-cycle double cover conjecture, which would be true in general if they would be true for cubic graphs. Since most of them are trivially true for $3$-edge-colorable
【 授权许可】
Others
【 预 览 】
Files | Size | Format | View |
---|---|---|---|
RO201909020566327ZK.pdf | 429KB | download |