Minimum length word-representants of graph products

DOI10.1016/J.DAM.2024.07.002zbMATH Open1547.05255MaRDI QIDQ6611055

Eshwar Srinivasan, Ramesh Hariharasubramanian

Publication date: 26 September 2024

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

zbMATH Keywords

Cartesian productword-representabilityrooted productminimum length word-representant

Mathematics Subject Classification ID

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

Cites Work

• Words and graphs
• Word problem of the Perkins semigroup via directed acyclic graphs.
• A comprehensive introduction to the theory of word-representable graphs
• On the interrelation between synchronized and non-synchronized behaviour of Petri Nets
• On representable graphs
• On graphs with representation number 3
• Enumeration and extensions of word-representants
• Minimum length word-representants of word-representable graphs

This page was built for publication: Minimum length word-representants of graph products

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