Pages that link to "Item:Q5901488"
From MaRDI portal
The following pages link to Reconfigurations in Graphs and Grids (Q5901488):
Displaying 20 items.
- Reconfiguration of list edge-colorings in a graph (Q713316) (← links)
- The packing number of the double vertex graph of the path graph (Q1671357) (← links)
- Independent-set reconfiguration thresholds of hereditary graph classes (Q1801058) (← links)
- Multi-color pebble motion on graphs (Q1957647) (← links)
- Pebble exchange group of graphs (Q2033933) (← links)
- The edge-connectivity of token graphs (Q2045395) (← links)
- Parameterized complexity of reconfiguration of atoms (Q2154105) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- The connectivity of token graphs (Q2413643) (← links)
- On Reconfiguration of Disks in the Plane and Related Problems (Q3183460) (← links)
- Reconfiguration of List Edge-Colorings in a Graph (Q3183470) (← links)
- Space-Aware Reconfiguration (Q3381950) (← links)
- Independence and matching numbers of some token graphs (Q5109075) (← links)
- Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch (Q5203793) (← links)
- Token Swapping on Trees (Q6045462) (← links)
- Space-aware reconfiguration (Q6045789) (← links)
- Ubiquity of graphs with nowhere‐linear end structure (Q6074597) (← links)
- 1-Complex $s,t$ Hamiltonian Paths: Structure and Reconfiguration in Rectangular Grids (Q6107029) (← links)
- Solving simultaneous target assignment and path planning efficiently with time-independent execution (Q6108766) (← links)
- Parameterized complexity of reconfiguration of atoms (Q6623588) (← links)
