Hadwiger's conjecture for degree sequences

Guantao Chen, Katsuhiro Ota

研究成果: Article査読

1 被引用数 (Scopus)

抄録

Hadwiger conjectured that every graph contains Kχ(G) as a minor, where χ(G) is the chromatic number of G. In 2005, Robertson made a weaker conjecture that for any graph G, there exists a graph H with the same degree sequence of G and containing Kχ(G) as a minor, which was confirmed by Dvořák and Mohar recently. In this note, we give a short proof of Robertson's Conjecture.

本文言語English
ページ(範囲)247-249
ページ数3
ジャーナルJournal of Combinatorial Theory. Series B
114
DOI
出版ステータスPublished - 2015 9 1

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

フィンガープリント 「Hadwiger's conjecture for degree sequences」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル