Scholarlink

This chapter describes a recursion formula of the chromatic polynomial of a maximal planar graph, which is different from that of edge contraction. Based on this, two ideas for proving the Four Color Conjecture are proposed (Xu, J. Electron. Inf. Technol. 38(4), 33–40 (2016)).

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Recursion Formulae of Chromatic Polynomial and Four-Color Conjecture

  • 章节

  • 出版模式：

    开放获取

  • 发表日期：

    2025年

查看全文
  • Jin Xu

摘要

This chapter describes a recursion formula of the chromatic polynomial of a maximal planar graph, which is different from that of edge contraction. Based on this, two ideas for proving the Four Color Conjecture are proposed (Xu, J. Electron. Inf. Technol. 38(4), 33–40 (2016)).