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...
Main Authors: | Scott, A, Seymour, P, Wood, D |
---|---|
פורמט: | Journal article |
יצא לאור: |
Wiley
2018
|
פריטים דומים
-
Graphs of low chordality
מאת: Sunil Chandran, et al.
יצא לאור: (2005-01-01) -
Graphs of low chordality
מאת: L. Sunil Chandran, et al.
יצא לאור: (2005-12-01) -
Edge erasures and chordal graphs
מאת: Jared Culbertson, et al.
יצא לאור: (2021-10-01) -
Chordal Networks of Polynomial Ideals
מאת: Cifuentes, Diego Fernando, et al.
יצא לאור: (2019) -
Bad News
מאת: Cecilia Stenbom, et al.
יצא לאור: (2023-06-01)