Word-representable graph: Difference between revisions

Revision as of 20:55, 12 April 2020

Revision as of 09:02, 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.]]

Line 144 ⟶ 145:

# [https://personal.cis.strath.ac.uk/sergey.kitaev/index_files/Papers/repgr.pdf S. Kitaev and A. Pyatkin. On representable graphs, J. Autom., Lang. and Combin. 13 (2008), 45−54.]

# [https://link.springer.com/article/10.1134%2FS1990478918020084 S. Kitaev and A. Pyatkin. Word-representable graphs: a Survey, Journal of Applied and Industrial Mathematics 12(2) (2018) 278−296.]

#[[arxiv:2003.06204|S. Kitaev and A. Pyatkin. On semi-transitive orientability of triangle-free graphs, arXiv:2003.06204v1.]]

#[[arxiv:1903.02777|S. Kitaev and A. Saito. On semi-transitive orientability of Kneser graphs and their complements, Discrete Math., to appear.]]

# [http://120.52.51.19/file.scirp.org/pdf/OJDM20110200008_15101466.pdf S. Kitaev, P. Salimov, C. Severs, and H. Úlfarsson. Word-representability of line graphs, Open Journal of Discrete Mathematics 1 (2011) 2, 96−101.]