Pages that link to "Item:Q2470462"
From MaRDI portal
The following pages link to Connectedness of the graph of vertex-colourings (Q2470462):
Displaying 18 items.
- Reconfiguring vertex colourings of 2-trees (Q5217099) (← links)
- (Q5241089) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q5361235) (← links)
- On k-Total Dominating Graphs (Q5377032) (← links)
- Kempe equivalence of colourings of cubic graphs (Q5890904) (← links)
- Kempe equivalence of colourings of cubic graphs (Q5965525) (← links)
- Kempe equivalence of 4‐critical planar graphs (Q6047640) (← links)
- Optimally reconfiguring list and correspondence colourings (Q6057471) (← links)
- On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets (Q6063279) (← links)
- (Q6087216) (← links)
- (Q6089671) (← links)
- Block symmetries in graph coloring reconfiguration systems (Q6107838) (← links)
- Token sliding on graphs of girth five (Q6182683) (← links)
- 5‐Coloring reconfiguration of planar graphs with no short odd cycles (Q6199387) (← links)
- Reconfiguration of vertex colouring and forbidden induced subgraphs (Q6201889) (← links)
- Reconfiguration graph for vertex colourings of weakly chordal graphs (Q6621198) (← links)
- Parameterized complexity of reconfiguration of atoms (Q6623588) (← links)
- List recoloring of planar graphs (Q6671387) (← links)