Journal title
Journal of Graph Theory
DOI
10.1002/jgt.22363
Issue
5
Volume
90
Last updated
2024-04-11T10:47:54.347+01:00
Page
5-12
Abstract
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 answer is still ‘no’ for several relaxations of the question.
Symplectic ID
833232
Submitted to ORA
On
Favourite
Off
Publication type
Journal Article
Publication date
12 Jun 2018