Properties of generalized derangement graphs
From MaRDI portal
Publication:365948
DOI10.2140/involve.2013.6.25zbMath1271.05073arXiv1106.5522OpenAlexW2126883291WikidataQ60692715 ScholiaQ60692715MaRDI QIDQ365948
Les Reid, Hannah Jackson, Kathryn L. Nyman
Publication date: 10 September 2013
Published in: Involve (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1106.5522
Permutations, words, matrices (05A05) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)
Related Items (3)
3-setwise intersecting families of the symmetric group ⋮ Unnamed Item ⋮ Setwise intersecting families of permutations
This page was built for publication: Properties of generalized derangement graphs
