数学
猜想
组合数学
顶点(图论)
Dirac(视频压缩格式)
离散数学
图形
量子力学
物理
中微子
标识
DOI:10.1002/jgt.3190160109
摘要
Abstract A Short proof is given of the theorem that every grph that does not have K 4 as a subcontraction is properly vertex 3‐colorable.
科研通智能强力驱动
Strongly Powered by AbleSci AI