A remarkable connection between k-permutations and colourings of graphs

DOI10.1080/09720502.2011.10700737zbMATH Open1235.05005OpenAlexW2314168335MaRDI QIDQ3171928FDOQ3171928

Mario Gionfriddo

Publication date: 5 October 2011

Published in: Journal of Interdisciplinary Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720502.2011.10700737

Recommendations

• scientific article
• Coloured permutations containing and avoiding certain patterns
• Generating Permutations with k-Differences
• Tight bounds on the threshold for permuted \(k\)-colorability
• Properties of generalized derangement graphs

zbMATH Keywords

vertex-colourings

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: A remarkable connection between \(k\)-permutations and colourings of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3171928)