Word-representability of line graphs

DOI10.4236/OJDM.2011.12012MaRDI QIDQ5350464zbMATH OpenOpenAlexFDO

Authors Sergey Kitaev, Christopher Severs, Henning Úlfarsson, Pavel Salimov

Publication date 1 September 2017

Published in Open Journal of Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4236/ojdm.2011.12012

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Combinatorics on words (68R15)

Recommendations

• On the Representability of Line Graphs
• On representable graphs
• Word-Representable Graphs: a Survey
• New results on word-representable graphs
• A comprehensive introduction to the theory of word-representable graphs

Cited in

(13)

• Certain distance-based topological indices of Parikh word representable graphs
• Representing split graphs by words
• On semi-transitive orientability of Kneser graphs and their complements
• Word-representability of triangulations of grid-covered cylinder graphs
• Wiener-type indices of Parikh word representable graphs
• New results on word-representable graphs
• Word-Representable Graphs: a Survey
• Representing graphs via pattern avoiding words
• On the Representability of Line Graphs
• The \(k\)-dimensional cube is \(k\)-representable
• On representable graphs
• Parikh word representable graphs and morphisms
• On word-representability of polyomino triangulations

This page was built for publication: Word-representability of line graphs

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