27^th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany

Nicolas Bousquet, V. B. (2019). 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany.

Type

Unclassified

Intellectual base

Unclassified

Year

2019

DOI

10.4230/lipics.esa.2019.24

Link

https://doi.org/10.4230/lipics.esa.2019.24

Cited by

1 citation across 1 artifact.

Domain-specific

• Cereceda's conjecture
  • For a graph of degeneracy d and at least d plus two colors, the coloring-reconfiguration graph should have diameter bounded quadratically in the number of vertices, under the exact threshold convention.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:142e49fbb39a · see in the full table