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