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

DOI10.1016/J.DAM.2023.12.017arXiv2312.10377OpenAlexW4390150971MaRDI QIDQ6153476FDOQ6153476

Authors: Sumin Huang, Sergey Kitaev, Artem 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

Recommendations

• Word-representable graphs: orientations, posets, and bounds
• Semi-transitive orientations and word-representable graphs
• Solving computational problems in the theory of word-representable graphs
• New results on word-representable graphs
• Word-Representable Graphs: a Survey

zbMATH Keywords

homomorphismsemi-transitive orientationword-representabilitysimplified de Bruijn-type graph

Mathematics Subject Classification ID

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

Cites Work

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

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

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