Hadwiger's conjecture for degree sequences

Guantao Chen, Katsuhiro Ota

Research output: Contribution to journalArticlepeer-review

1 Citation (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.

Original languageEnglish
Pages (from-to)247-249
Number of pages3
JournalJournal of Combinatorial Theory. Series B
Publication statusPublished - 2015 Sept 1


  • Chromatic numbers
  • Degree sequences
  • Graph minors
  • Hadwiger's conjecture

ASJC Scopus subject areas

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


Dive into the research topics of 'Hadwiger's conjecture for degree sequences'. Together they form a unique fingerprint.

Cite this