Pages that link to "Item:Q2131856"
From MaRDI portal
The following pages link to A polynomial version of Cereceda's conjecture (Q2131856):
Displaying 22 items.
- A conjecture of Regev about the Capelli polynomial (Q579383) (← links)
- Fast recoloring of sparse graphs (Q896058) (← links)
- Some consequences of the polynomial Freiman-Ruzsa conjecture (Q1022285) (← links)
- On a conjecture of Graham and Häggkvist with the polynomial method (Q1039430) (← links)
- A polynomial bound for the lap number (Q1431472) (← links)
- Paths between colourings of sparse graphs (Q1621073) (← links)
- A Thomassen-type method for planar graph recoloring (Q2033925) (← links)
- Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph (Q2121792) (← links)
- List-recoloring of sparse graphs (Q2145762) (← links)
- On the diameter of reconfiguration graphs for vertex colourings (Q2857338) (← links)
- (Q2939032) (← links)
- The combinatorial rigidity conjecture is false for cubic polynomials (Q4417279) (← links)
- Some comments on Akiyama's conjecture on CNS polynomials (Q4600860) (← links)
- Toward Cereceda's conjecture for planar graphs (Q5110690) (← links)
- The Woods-Erdős conjecture for polynomial rings (Q5957920) (← links)
- Optimally reconfiguring list and correspondence colourings (Q6057471) (← links)
- Digraph redicolouring (Q6146501) (← links)
- Strengthening a Theorem of Meyniel (Q6158364) (← links)
- 5‐Coloring reconfiguration of planar graphs with no short odd cycles (Q6199387) (← links)
- Kempe changes in degenerate graphs (Q6563986) (← links)
- Redicolouring digraphs: directed treewidth and cycle-degeneracy (Q6585259) (← links)
- List recoloring of planar graphs (Q6671387) (← links)
