The connectivity of token graphs
From MaRDI portal
Publication:2413643
DOI10.1007/S00373-018-1913-9zbMATH Open1395.05096OpenAlexW2808762268MaRDI QIDQ2413643FDOQ2413643
Recommendations
Cites Work
- A generalisation of Johnson graphs with an application to triple factorisations
- A linear-time algorithm for the feasibility of pebble motion on trees
- Non-isomorphic graphs with cospectral symmetric powers
- On the chromatic number, colorings, and codes of the Johnson graph
- On the complexity of reconfiguration problems
- Reconfigurations in Graphs and Grids
- Regularity and planarity of token graphs
- Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements
- Swapping labeled tokens on graphs
- Symmetric squares of graphs
- The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
- The \((n^ 2-1)\)-puzzle and related relocation problems
- The complexity of change
- Token graphs
Cited In (16)
- Computing spectral bounds of the Heisenberg ferromagnet from geometric considerations
- On the Connectivity of Token Graphs of Trees
- Hamiltonicity of token graphs of fan graphs
- Reconfiguration of connected graph partitions
- Graphs isomorphisms under edge-replacements and the family of amoebas
- On the 2-token graph of a graph
- The edge-connectivity of token graphs
- Token graphs
- Automorphism group of 2-token graph of the Hamming graph
- The packing number of the double vertex graph of the path graph
- Edge-transitive token graphs
- Independence and matching numbers of some token graphs
- Regularity and planarity of token graphs
- Independence numbers of some double vertex graphs and pair graphs
- The automorphisms of 2-token graphs
- The automorphism groups of some token graphs
This page was built for publication: The connectivity of token graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413643)
