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...
Glavni autori: | Scott, A, Seymour, P, Wood, D |
---|---|
Format: | Journal article |
Izdano: |
Wiley
2018
|
Slični predmeti
-
Graphs of low chordality
od: Sunil Chandran, i dr.
Izdano: (2005-01-01) -
Graphs of low chordality
od: L. Sunil Chandran, i dr.
Izdano: (2005-12-01) -
Edge erasures and chordal graphs
od: Jared Culbertson, i dr.
Izdano: (2021-10-01) -
Chordal Networks of Polynomial Ideals
od: Cifuentes, Diego Fernando, i dr.
Izdano: (2019) -
Bad News
od: Cecilia Stenbom, i dr.
Izdano: (2023-06-01)