Revision as of 15:06, 7 May 2020 edit Jonesey95 (talk \| contribs) Autopatrolled, Extended confirmed users, Page movers, Mass message senders, Template editors 411,175 edits m Fix ISBN error or other ISBN error using AutoEd (or wrap invalid ISBN in template to show error message) ← Previous edit		Revision as of 10:06, 30 May 2020 edit undo JzG (talk \| contribs) Edit filter managers, Autopatrolled, Extended confirmed users, Page movers, New page reviewers, Pending changes reviewers, Rollbackers 155,515 edits Remove predatory open access (Scientific Research Publishing) Next edit →
Line 141: #[[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.] # [[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.]] # [https://link.springer.com/article/10.1007/s11083-008-9083-7 S. Kitaev and S. Seif. Word problem of the Perkins semigroup via directed acyclic graphs, Order 25 (2008), 177−194.]

Word-representable graph: Difference between revisions