An embedding technique in the study of word-representability of graphs

DOI10.1016/j.dam.2023.12.017arXiv2312.10377OpenAlexW4390150971MaRDI QIDQ6153476

Sumin Huang, Sergey Kitaev, Artem V. Pyatkin

Publication date: 14 February 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

homomorphismsemi-transitive orientationword-representabilitysimplified de Bruijn-type graph

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Words and graphs
• Semi-transitive orientations and word-representable graphs
• Universal cycles for combinatorial structures
• A comprehensive introduction to the theory of word-representable graphs
• An Eulerian path approach to DNA fragment assembly

This page was built for publication: An embedding technique in the study of word-representability of graphs