Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations

DOI10.1007/s00373-020-02232-2zbMath1459.05002arXiv2009.01410OpenAlexW3085046325MaRDI QIDQ2657073

Ji-Hwan Jung, Kittitat Iamthong, Sergey Kitaev

Publication date: 17 March 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.01410

zbMATH Keywords

permutation patternbalanced wordRiordan graph\(p\)-Riordan graph\(p\)-Riordan word

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group

Uses Software

• OEIS

Cites Work

• Unnamed Item
• On the chromatic number of Toeplitz graphs
• Patterns in permutations and words.
• Words and graphs
• Hamiltonian properties of Toeplitz graphs
• The Riordan group
• Finite transition matrices for permutations avoiding pairs of length four patterns
• Refined restricted permutations avoiding subsets of patterns of length three
• Riordan graphs I: structural properties
• A comprehensive introduction to the theory of word-representable graphs
• Riordan graphs. II: Spectral properties

This page was built for publication: Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations