A comprehensive introduction to the theory of word-representable graphs
From MaRDI portal
Publication:2408791
DOI10.1007/978-3-319-62809-7_2zbMath1494.68205arXiv1705.05924OpenAlexW2614598353MaRDI QIDQ2408791
Publication date: 13 October 2017
Full work available at URL: https://arxiv.org/abs/1705.05924
Combinatorics on words (68R15) Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (13)
Word-representability of split graphs generated by morphisms ⋮ Representing split graphs by words ⋮ Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations ⋮ On semi-transitive orientability of Kneser graphs and their complements ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ On operations preserving semi-transitive orientability of graphs ⋮ An embedding technique in the study of word-representability of graphs ⋮ Minimum length word-representants of word-representable graphs ⋮ Solving computational problems in the theory of word-representable graphs ⋮ Enumeration and extensions of word-representants ⋮ Polygon-circle and word-representable graphs ⋮ Word-representability of Toeplitz graphs ⋮ On the 12-representability of induced subgraphs of a grid graph
This page was built for publication: A comprehensive introduction to the theory of word-representable graphs
