Minimum length word-representants of word-representable graphs
DOI10.1016/J.DAM.2023.10.021zbMATH Open1529.05118OpenAlexW4388029872MaRDI QIDQ6180656FDOQ6180656
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
Recommendations
triangle-free graphscomplete bipartite graphsword-representabilityladder graphscrown graphminimum length word-representant
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
Cited In (2)
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)