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...
Autori principali: | Scott, A, Seymour, P, Wood, D |
---|---|
Natura: | Journal article |
Pubblicazione: |
Wiley
2018
|
Documenti analoghi
Documenti analoghi
-
Graphs of low chordality
di: Sunil Chandran, et al.
Pubblicazione: (2005-01-01) -
Graphs of low chordality
di: L. Sunil Chandran, et al.
Pubblicazione: (2005-12-01) -
Edge erasures and chordal graphs
di: Jared Culbertson, et al.
Pubblicazione: (2021-10-01) -
Chordal Networks of Polynomial Ideals
di: Cifuentes, Diego Fernando, et al.
Pubblicazione: (2019) -
Bad News
di: Cecilia Stenbom, et al.
Pubblicazione: (2023-06-01)