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...
Principais autores: | Scott, A, Seymour, P, Wood, D |
---|---|
Formato: | Journal article |
Publicado em: |
Wiley
2018
|
Registros relacionados
Registros relacionados
-
Graphs of low chordality
por: Sunil Chandran, et al.
Publicado em: (2005-01-01) -
Graphs of low chordality
por: L. Sunil Chandran, et al.
Publicado em: (2005-12-01) -
Edge erasures and chordal graphs
por: Jared Culbertson, et al.
Publicado em: (2021-10-01) -
Chordal Networks of Polynomial Ideals
por: Cifuentes, Diego Fernando, et al.
Publicado em: (2019) -
Bad News
por: Cecilia Stenbom, et al.
Publicado em: (2023-06-01)