Minimum length word-representants of word-representable graphs

DOI10.1016/J.DAM.2023.10.021MaRDI QIDQ6180656zbMATH OpenOpenAlexFDO

Authors Eshwar Srinivasan, Ramesh Hariharasubramanian

Publication date 2 January 2024

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

Full work available at URL https://doi.org/10.1016/j.dam.2023.10.021

zbMATH Keywords

complete bipartite graphscrown graphladder graphsminimum length word-representanttriangle-free graphsword-representability

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Minimum length word-representants of graph products
• Word-representable graphs: orientations, posets, and bounds
• New results on word-representable graphs

Cites work

• A comprehensive introduction to the theory of word-representable graphs
• Alternation graphs
• On graphs with representation number 3
• On representable graphs
• On the representation number of a crown graph
• Word problem of the Perkins semigroup via directed acyclic graphs.
• Words and graphs

Cited in

(3)

• Minimum length word-representants of graph products
• Computing shortest 12-representants of labeled graphs
• Characterization of double-arborescences and their minimum length word-representants

This page was built for publication: Minimum length word-representants of word-representable graphs

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