References
- Archdeacon D. The complexity of the graph embedding problem. In: Bodendiek R, Henn R, editors. Topics in combinatorics and graph theory. Heidelberg: Physica-Verlag; 1990. p. 59–64
- Kawarabayashi K-I, Mohar B, Reed B. A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded tree-width, 0272-5428/08 XXXXXXXX 2008 IEEE. doi:https://doi.org/10.1109/FOCS.2008.53.
- Juvan M, Mohar B. A linear time algorithm for the 2-Mobius band embedding extension problem. SIAM J Discrete Math. 1997;10(1):57–72. doi: https://doi.org/10.1137/S0895480194264150
- Mohar B. Embedding graphs in an arbitrary surface in linear time. In: Proc. 28th Ann. ACM STOC. Philadelphia: ACM Press; 1996. p. 392–397.
- Mohar B. A linear time algorithm for embedding of graphs in an arbitrary surface. SIAM J Discrete Math. 1999;12:6–26. doi: https://doi.org/10.1137/S089548019529248X
- Mohar B. Obstructions for the disk and the cylinder embedding extension problems. Comb Probab Comput. 1994;3:375–406. doi: https://doi.org/10.1017/S0963548300001279
- Pereira J, Singh T, Arumugam S. Graceful embedding of graphs with property P; submitted 2015.
- Acharya Mukti, Singh T. Construction of graceful signed graphs. Def Si J. 2006;56(5):801–808. doi: https://doi.org/10.14429/dsj.56.1948
- Acharya Mukti, Singh T. Embedding of sigraphs in graceful sigraphs. ARS Combinatoria. 2013;111:421–426.
- Zaslavsky T. Orientation embedding of signed graphs. J Graph Theory. 1992;16(5):399–422. doi: https://doi.org/10.1002/jgt.3190160503
- Behzad M, Chartrand G. Introduction to the theory of graphs. Boston: Allyn and Bacon, Inc.; 1971.
- Harary F. Graph theory. Reading (MA): Addison-Wesley Publ. Comp.; 1969.
- West DB. Introduction to graph theory. Upper Saddle River: Prentice-Hall of India Pvt. Ltd.; 1996.
- Zaslavsky T. Signed graphs. Discrete Math. 1982;4:47–74. doi: https://doi.org/10.1016/0166-218X(82)90033-6
- Zaslavsky T. Glossary of signed and gain graphs and allied areas. II Edition Electron J Combin. 1998;#DS9.
- Zaslavsky T. A mathematical bibliography of signed and gain graphs and allied areas. VIII Edition Electron J Combin. 2009;#DS8.
- Sinha D, Garg P. On the regularity of some signed graph structures. AKCE Int J Graphs Comb. 2011;8(1):63–74.
- Chartrand G, Gavlas H, Harary F, et al. On signed degrees in signed graphs. Czechoslovak Math J. 1994;44:677–690.
- Shahul Hameed K, Paul V, Germina KA. On co-regular signed graphs. Australas J Combin. 2015;62(1):8–17.
- Acharya BD. Construction of certain infinite families of graceful graphs from a given graceful graph. Def Sci J. 1982;32(3):231–236. doi: https://doi.org/10.14429/dsj.32.6301
- Sinha D, Rao AK. Embedding of signed regular graphs. Notes Number Theory Discrete Math. 2018;24(3):131–141. doi: https://doi.org/10.7546/nntdm.2018.24.3.131-141
- Sinha D, Rao AK, Garg P. Embedding of (i,j)-regular signed graphs in (i+k,j+l)-regular signed graphs. In: IEEE explore, 2016 International Workshop on Computational Intelligence, Dhaka, Bangladesh, 12–13 December 2016. p. 215–217
- Gardiner A. Embedding k-regular graphs in k + 1-regular graphs. J London Math Soc. 1983;28(2):393–400. doi: https://doi.org/10.1112/jlms/s2-28.3.393
- Bollobas B, Eldridge SE. Maximal matchings in graphs with given minimal and maximal degrees. Math Proc Cambridge Philos Soc. 1976;79:221–234. doi: https://doi.org/10.1017/S0305004100052233
- Schwenk AJ. The spectrum of a graph [Ph.D. thesis]. The University of Michigan; 1973.
- Cvetkovic DM. Graphs and their spectra. Publ Elektroteh Fak, Univ Beogr, Ser Mat fiz. 1971;354/356:1–50.