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...
المؤلفون الرئيسيون: | Scott, A, Seymour, P, Wood, D |
---|---|
التنسيق: | Journal article |
منشور في: |
Wiley
2018
|
مواد مشابهة
-
Graphs of low chordality
حسب: Sunil Chandran, وآخرون
منشور في: (2005-01-01) -
Graphs of low chordality
حسب: L. Sunil Chandran, وآخرون
منشور في: (2005-12-01) -
Edge erasures and chordal graphs
حسب: Jared Culbertson, وآخرون
منشور في: (2021-10-01) -
Chordal Networks of Polynomial Ideals
حسب: Cifuentes, Diego Fernando, وآخرون
منشور في: (2019) -
Bad News
حسب: Cecilia Stenbom, وآخرون
منشور في: (2023-06-01)