Revision as of 00:40, 3 April 2020 edit Headbomb (talk \| contribs) Edit filter managers, Autopatrolled, Extended confirmed users, Page movers, File movers, New page reviewers, Pending changes reviewers, Rollbackers, Template editors 473,523 edits m Reverted edits by JCW-CleanerBot (talk) to last version by Mark viking Tag: Rollback ← Previous edit		Revision as of 20:55, 12 April 2020 edit undo S. Kitaev (talk \| contribs) 96 edits No edit summary Tag: 2017 wikitext editor Next edit →
Line 144: # [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:1903.02777\|S. Kitaev and A. Saito. On semi-transitive orientability of Kneser graphs and their complements, ~~arxiv:1903~~Discrete Math.~~02777~~, 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.] # [[arxiv:1102.3980\|S. Kitaev, P. Salimov, C. Severs, and H. Úlfarsson (2011) On the representability of line graphs. In: G. Mauri, A. Leporati (eds), Developments in Language Theory. DLT 2011. Lecture Notes Comp. Sci. 6795, Springer, 478−479.]]

Word-representable graph: Difference between revisions