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...
Hlavní autoři: | Scott, A, Seymour, P, Wood, D |
---|---|
Médium: | Journal article |
Vydáno: |
Wiley
2018
|
Podobné jednotky
-
Graphs of low chordality
Autor: Sunil Chandran, a další
Vydáno: (2005-01-01) -
Graphs of low chordality
Autor: L. Sunil Chandran, a další
Vydáno: (2005-12-01) -
Edge erasures and chordal graphs
Autor: Jared Culbertson, a další
Vydáno: (2021-10-01) -
Chordal Networks of Polynomial Ideals
Autor: Cifuentes, Diego Fernando, a další
Vydáno: (2019) -
Bad News
Autor: Cecilia Stenbom, a další
Vydáno: (2023-06-01)