The connectivity of token graphs (Q2413643)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The connectivity of token graphs	scientific article

Statements

scholarly article

0 references

The connectivity of token graphs (English)

0 references

0 references

Ana Laura Trujillo-Negrete

0 references

Graphs and Combinatorics

0 references

publication date

14 September 2018

0 references

zbMATH Keywords

token graphs

0 references

connectivity

0 references

Menger's theorem

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00373-018-1913-9

0 references

A generalisation of Johnson graphs with an application to triple factorisations

0 references

Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements

0 references

Symmetric squares of graphs

0 references

A linear-time algorithm for the feasibility of pebble motion on trees

0 references

Reconfigurations in Graphs and Grids

0 references

Regularity and planarity of token graphs

0 references

On the chromatic number, colorings, and codes of the Johnson graph

0 references

0 references

On the complexity of reconfiguration problems

0 references

Non-isomorphic graphs with cospectral symmetric powers

0 references

The \((n^ 2-1)\)-puzzle and related relocation problems

0 references

The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)

0 references

The complexity of change

0 references

Swapping labeled tokens on graphs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s00373-018-1913-9

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2413643

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2413643&oldid=36426727"