Word-representable graph: Difference between revisions

Revision as of 09:02, 13 April 2020

Revision as of 09:03, 13 April 2020

Line 128:

# [https://www.lehmanns.de/shop/mathematik-informatik/48968161-9783030287955-combinatorics-on-words M. Gaetz and C. Ji. Enumeration and extensions of word-representable graphs. Lecture Notes in Computer Science 11682 (2019) 180−192. In R. Mercas, D. Reidenbach (Eds) Combinatorics on Words. WORDS 2019.]

# [[arXiv:1909.00019|M. Gaetz and C. Ji. Enumeration and Extensions of Word-representants, arXiv:1909.00019.]]

# [[https://link.springer.com/chapter/10.1007/978-3-030-28796-2_14|M. Gaetz and C. Ji. Enumeration and Extensions of Word-representants, Combinatorics on words, 180-192, Lecture Notes in Comput. Sci., 11682, Springer, Cham, 2019.]]

# [[arxiv:1602.08965|A. Gao, S. Kitaev, and P. Zhang. On 132-representable graphs. Australasian J. Combin. 69 (2017), 105−118.]]

# [[arxiv:1605.01688|M. Glen. Colourability and word-representability of near-triangulations, Pure and Applied Mathematics, to appear, 2019.]]