Bad news for chordal partitions

Alex Scott, Paul Seymour, David R Wood

Research output: Contribution to journalArticleResearchpeer-review

2 Citations (Scopus)


Reed and Seymour [1998] asked whether every graph has a partition into induced connected nonempty bipartite subgraphs such that the quotient graph is chordal. If true, this would have significant ramifications for Hadwiger's Conjecture. We prove that the answer is “no.” In fact, we show that the answer is still “no” for several relaxations of the question.

Original languageEnglish
Pages (from-to)5-12
Number of pages8
JournalJournal of Graph Theory
Issue number1
Publication statusPublished - 1 Jan 2019


  • chordal partition
  • graph
  • Hadwiger's conjecture
  • minor
  • partition

Cite this