References
- F. Agosta, S. Sala, P. Valsasina, A. Meani, E. Canu, G. Magnani, S.F. Cappa, E. Scola, P. Quatto, M.A. Horsfield, A. Falini, G. Comi, and M. Filippi, Brain network connectivity assessed using graph theory in frontotemporal dementia, Neurology 81(2) (2013), pp. 134–143.
- A.E. Amawy and S. Latifi, Properties and performance of folded hypercubes, IEEE Trans. Parallel Distrib. Syst. 2(1) (1991), pp. 31–42.
- M. Behzad, Graphs and their chromatic numbers, Ph.D thesis, Michigan State University, 1965.
- M. Behzad, Total concepts in graph theory, Ars Comb. 23 (1987), pp. 35–40.
- R.L. Brooks, On colouring the nodes of a network, Proc. Camb. Philos. Soc. 37(2) (1941), pp. 194–197.
- Y. Cao, G. Chen, and G. Jing, A note on Goldberg's conjecture of total chromatic numbers, J. Graph Theory 100(1) (2022), pp. 182–188.
- G. Chen and Y. Hao, On the coequal values of total chromatic number and chromatic index, J. Comb. Theory Ser. B 158 (2023), pp. 286–304.
- M. Chen, X. Guo, and S. Zhai, Total chromatic number of folded hypercubes, Ars Comb. 111 (2013), pp. 265–272.
- S.A. Choudum and V. Sunitha, Augmented cubes, Networks 40(2) (2001), pp. 71–74.
- M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman Publishers, New York, NY, 1979.
- M.K. Goldberg, Edge-coloring of multigraphs: Recoloring technique, J. Graph Theory 8 (1984), pp. 123–137.
- C.D. Godsil, Interesting graphs and their colourings (2003).Available at https://api.semanticscholar.org/CorpusID:115967696
- I. Holyer, The NP-completeness of edge-coloring, SIAM J. Comput. 10(4) (1981), pp. 718–720.
- F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Array, Trees, Hypercubes, Morgan Kaufmann Publishers, San Francisco, CA, 1991.
- Y. Li and S. Peng, Dual-cubes: A new interconnection network for high-performance computer clusters, Proc. Int. Comput. Arch. (2000), pp. 51–57.
- P.K.K. Loh, W.J. Hsu, and Y. Pan, The exchanged hypercube, IEEE Trans. Parallel Distrib. Syst.16(9) (2005), pp. 866–874.
- M. Ma and B. Liu, Cycles embedding in exchanged hypercubes, Inf. Process. Lett. 110(2) (2009), pp. 71–76.
- M. Ma and L. Zhu, The super connectivity of exchanged hypercubes, Inf. Process. Lett. 111(8) (2011), pp. 360–364.
- K. MacKeigan, A brief exploration of total colouring, Thesis submission (2017).Available at https://dalspace.library.dal.ca/handle/10222/73291
- A. Mashaghi, A. Ramezanpour, and V. Karimipour, Investigation of a protein complex network, Eur. Phys. J. B. 41(1) (2004), pp. 113–121.
- M. Rosenfeld, On the total colouring of certain graphs, Isr. J. Math. 9(3) (1971), pp. 396–402.
- N.F. Tzeng and S. Wei, Enhanced hypercubes, IEEE Trans. Comput. 40 (1991), pp. 284–294.
- F. Vecchio, Small world architecture in brain connectivity and hippocampal volume in Alzheimer's disease: A study via graph theory from EEG data, Brain Imaging Behav. 11(2) (2017), pp. 473–485.
- N. Vijayaditya, On total chromatic number of a graph, J. Lond. Math. Soc. 2(3) (1971), pp. 405–408.
- V.G. Vizing, On an estimate of the chromatic class of a p-graph, Diskret Anal. 3 (1964), pp. 25–30.
- V.G. Vizing, Some unsolved problems in graph theory, Russ. Math. Surv. 23(6) (1968), pp. 125–141.
- J.M. Xu, Topological Structure and Analysis of Interconnection Networks, Kluwer Academic Publishers, Canada, 2001.
- J.M. Xu, Combinatorial Theory in Networks, Mathematics Monograph Series, Vol. 26, Science Press, Beijing, 2013.