The Realizability of Theta Graphs as Reconfiguration Graphs of Minimum Independent Dominating Sets

[1] L.W. Beineke, Characterizations of derived graphs, J. Combinatorial Theory 9 (1970), 129–135. Search in Google Scholar

[2] R.C. Brewster, C.M. Mynhardt, and L.E. Teshima, Reconfiguration of minimum independent dominating sets in graphs, Commun. Comb. Optim. DOI: 10.22049/cco.2023.28965.1797. Search in Google Scholar

[3] G. Chartrand, L. Lesniak, and P. Zhang, Graphs and Digraphs, 6th edition, Chapman & Hall, London, 2015. Search in Google Scholar

[4] T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Domination in Graphs, Marcel Dekker, New York, 1998. Search in Google Scholar

[5] T.W. Haynes, S.T. Hedetniemi, and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998. Search in Google Scholar

[6] P.J. Heawood, On the four-color map theorem, Quart. J. Pure Math. 29 (1898), 270–285. Search in Google Scholar

[7] C.M. Mynhardt and S. Nasserasr, Reconfiguration of colourings and dominating sets in graphs, in: F. Chung et al. (eds.), 50 years of Combinatorics, Graph Theory, and Computing, Discrete Math. Appl. (Boca Raton), CRC Press, Boca Raton, FL, 2020, pp. 171–191. Search in Google Scholar

[8] C.M. Mynhardt and L.E. Teshima, A note on some variations of the γ-graph, J. Combin. Math. Combin. Comput. 104 (2018), 217–230. Search in Google Scholar

[9] L.E. Teshima, The i-Graph and Other Variations on the γ-Graph, PhD thesis, University of Victoria, 2022. Avaliable at https://dspace.library.uvic.ca. Search in Google Scholar

[10] M.-T. Tsai and D.B. West, A new proof of 3-colorability of Eulerian triangulations, Ars Math. Contemp. 4 (2011), no. 1, 73–77. Search in Google Scholar

[11] D.J.A. Welsh, Euler and bipartite matroids, J. Combinatorial Theory 6 (1969), 375–377. Search in Google Scholar