Word-Representability of Line Graphs

Show more

References

[1] S. Kitaev and A. Pyatkin, “On Representable Graphs,” Journal of Automata, Languages and Combinatorics, Vol. 13, No. 1, 2008, pp.45-54.

[2] M. M. Halldórsson, S. Kitaev and A. Pyatkin, “Graphs Capturing Alternations in Words,” In Proceedings of the 14th international conference on Developments in language theory, London, August 17-20, 2010, pp. 436-437.

[3] S. Kitaev and S. Seif, “Word Problem of the Perkins Semigroup via Directed Acyclic Graphs,” Order, Vol. 25, No. 3, 2008, pp. 177-194.
doi:10.1007/s11083-008-9083-7

[4] R. Graham and N. Zang, “Enumerating Split-Pair Arrangements,” Journal of Combinatorial Theory, Series A, Vol. 115, No. 2, 2008, pp. 293-303.
doi:10.1016/j.jcta.2007.06.003

[5] M. M. Halldorsson, S. Kitaev and A. Pyatkin, “On Representable Graphs, Semi-Transitive Orientations, and the Representation Numbers,” Submitted on 1 October 2008. http://arxiv.org/abs/0810.0310v1

[6] A. C. M. van Rooji and H. S. Wilf, “The Interchange Graph of a Finite Graph,” Acta Mathematica Academiae Scientiarum Hungaricae, Vol. 16, No. 3-4, 1965, pp.263- 269. doi:10.1007/BF01904834