Berend, Daniel; Cohen, Liat; Filtser, Omrit A tour of general Hanoi graphs. (English) Zbl 07784206 Theor. Comput. Sci. 983, Article ID 114289, 11 p. (2024). MSC: 68Qxx PDFBibTeX XMLCite \textit{D. Berend} et al., Theor. Comput. Sci. 983, Article ID 114289, 11 p. (2024; Zbl 07784206) Full Text: DOI
Zhu, Mingzhe; Sun, Haoxin; Li, Wei; Zhang, Zhongzhi Modeling spatial networks by contact graphs of disk packings. (English) Zbl 1520.05092 Theor. Comput. Sci. 973, Article ID 114066, 29 p. (2023). MSC: 05C82 68R10 PDFBibTeX XMLCite \textit{M. Zhu} et al., Theor. Comput. Sci. 973, Article ID 114066, 29 p. (2023; Zbl 1520.05092) Full Text: DOI
Liang, Jing; Zhao, Haixing; Yin, Jun A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks. (English) Zbl 07540235 Theor. Comput. Sci. 923, 144-159 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Liang} et al., Theor. Comput. Sci. 923, 144--159 (2022; Zbl 07540235) Full Text: DOI
Eppstein, David; Frishberg, Daniel; Maxwell, William On the treewidth of Hanoi graphs. (English) Zbl 07477129 Theor. Comput. Sci. 906, 1-17 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{D. Eppstein} et al., Theor. Comput. Sci. 906, 1--17 (2022; Zbl 07477129) Full Text: DOI arXiv
Wang, Yucheng; Bao, Qi; Zhang, Zhongzhi Combinatorial properties of Farey graphs. (English) Zbl 1444.05112 Theor. Comput. Sci. 796, 70-89 (2019). Reviewer: K. A. Germina (Kerala) MSC: 05C69 05C35 05C30 05C45 05C82 91D30 PDFBibTeX XMLCite \textit{Y. Wang} et al., Theor. Comput. Sci. 796, 70--89 (2019; Zbl 1444.05112) Full Text: DOI
Xiao, Yuzhi; Zhao, Haixing; Mao, Yaping; Chen, Guanrong Invulnerability of planar two-tree networks. (English) Zbl 1417.68165 Theor. Comput. Sci. 767, 16-25 (2019). MSC: 68R10 68M15 PDFBibTeX XMLCite \textit{Y. Xiao} et al., Theor. Comput. Sci. 767, 16--25 (2019; Zbl 1417.68165) Full Text: DOI
Ma, Fei; Yao, Bing An iteration method for computing the total number of spanning trees and its applications in graph theory. (English) Zbl 1383.05054 Theor. Comput. Sci. 708, 46-57 (2018). MSC: 05C05 05C10 05C85 05C82 PDFBibTeX XMLCite \textit{F. Ma} and \textit{B. Yao}, Theor. Comput. Sci. 708, 46--57 (2018; Zbl 1383.05054) Full Text: DOI
Jin, Yujia; Li, Huan; Zhang, Zhongzhi Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs. (English) Zbl 1380.05182 Theor. Comput. Sci. 703, 37-54 (2017). MSC: 05C82 05C70 05C69 05C35 PDFBibTeX XMLCite \textit{Y. Jin} et al., Theor. Comput. Sci. 703, 37--54 (2017; Zbl 1380.05182) Full Text: DOI arXiv
Li, Huan; Zhang, Zhongzhi Maximum matchings in scale-free networks with identical degree distribution. (English) Zbl 1370.68233 Theor. Comput. Sci. 675, 64-81 (2017). MSC: 68R10 05C70 05C82 PDFBibTeX XMLCite \textit{H. Li} and \textit{Z. Zhang}, Theor. Comput. Sci. 675, 64--81 (2017; Zbl 1370.68233) Full Text: DOI arXiv
Zhang, Zhongzhi; Wu, Shunqi; Li, Mingyun; Comellas, Francesc The number and degree distribution of spanning trees in the Tower of Hanoi graph. (English) Zbl 1332.05036 Theor. Comput. Sci. 609, Part 2, 443-455 (2016). MSC: 05C05 05C07 05C85 PDFBibTeX XMLCite \textit{Z. Zhang} et al., Theor. Comput. Sci. 609, Part 2, 443--455 (2016; Zbl 1332.05036) Full Text: DOI arXiv
Zhang, Zhongzhi; Wu, Bin Pfaffian orientations and perfect matchings of scale-free networks. (English) Zbl 1306.05198 Theor. Comput. Sci. 570, 55-69 (2015). MSC: 05C70 05C82 PDFBibTeX XMLCite \textit{Z. Zhang} and \textit{B. Wu}, Theor. Comput. Sci. 570, 55--69 (2015; Zbl 1306.05198) Full Text: DOI
Zhang, Zhongzhi; Comellas, Francesc Farey graphs as models for complex networks. (English) Zbl 1206.68245 Theor. Comput. Sci. 412, No. 8-10, 865-875 (2011). MSC: 68R10 68M10 11B57 PDFBibTeX XMLCite \textit{Z. Zhang} and \textit{F. Comellas}, Theor. Comput. Sci. 412, No. 8--10, 865--875 (2011; Zbl 1206.68245) Full Text: DOI arXiv
Barrière, L.; Cohen, J.; Mitjana, M. Gossiping in chordal rings under the line model. (English) Zbl 0972.68010 Theor. Comput. Sci. 264, No. 1, 53-64 (2001). MSC: 68M12 68M14 PDFBibTeX XMLCite \textit{L. Barrière} et al., Theor. Comput. Sci. 264, No. 1, 53--64 (2001; Zbl 0972.68010) Full Text: DOI