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