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)