Bad news for chordal partitions

Reed and Seymour [1998] asked whether every graph has a partition into induced connected non-empty 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 an...

詳細記述

書誌詳細
主要な著者: Scott, A, Seymour, P, Wood, D
フォーマット: Journal article
出版事項: Wiley 2018

類似資料