Vallières, Daniel On abelian \(\ell\)-towers of multigraphs. (English. French summary) Zbl 1473.05192 Ann. Math. Qué. 45, No. 2, 433-452 (2021). MSC: 05C50 05C10 05C25 05C30 11M06 PDF BibTeX XML Cite \textit{D. Vallières}, Ann. Math. Qué. 45, No. 2, 433--452 (2021; Zbl 1473.05192) Full Text: DOI arXiv OpenURL
Ivanov, Aleksandr Olegovich; Tuzhilin, Alekseĭ Avgustinovich Gromov-Hausdorff distances to simplexes and some applications to discrete optimisation. (English) Zbl 1459.05358 Chebyshevskiĭ Sb. 21, No. 2(74), 169-189 (2020). MSC: 05E45 05C05 05C35 05C15 90C35 54E35 PDF BibTeX XML Cite \textit{A. O. Ivanov} and \textit{A. A. Tuzhilin}, Chebyshevskiĭ Sb. 21, No. 2(74), 169--189 (2020; Zbl 1459.05358) Full Text: DOI MNR OpenURL
Xu, Xiaojing; Wang, Peiwen; Wang, Zhiping The normalized Laplacian spectrum of pentagonal graphs and its applications. (English) Zbl 1449.05177 J. Math. Res. Appl. 39, No. 4, 343-352 (2019). MSC: 05C50 PDF BibTeX XML Cite \textit{X. Xu} et al., J. Math. Res. Appl. 39, No. 4, 343--352 (2019; Zbl 1449.05177) Full Text: DOI OpenURL
Liao, Yunhua; Xie, Xiaoliang; Hou, Yaoping; Aziz-Alaoui, M. A. Tutte polynomials of two self-similar network models. (English) Zbl 1412.82011 J. Stat. Phys. 174, No. 4, 893-905 (2019). MSC: 82B20 05C05 05C82 05C31 PDF BibTeX XML Cite \textit{Y. Liao} et al., J. Stat. Phys. 174, No. 4, 893--905 (2019; Zbl 1412.82011) Full Text: DOI OpenURL
Ma, Fei; Yao, Bing A family of small-world network models built by complete graph and iteration-function. (English) Zbl 07546972 Physica A 492, 2205-2219 (2018). MSC: 82-XX PDF BibTeX XML Cite \textit{F. Ma} and \textit{B. Yao}, Physica A 492, 2205--2219 (2018; Zbl 07546972) Full Text: DOI OpenURL
Došlić, Tomislav On the number of spanning trees in alternating polycyclic chains. (English) Zbl 1410.92173 J. Math. Chem. 56, No. 9, 2794-2800 (2018). MSC: 92E10 05C90 PDF BibTeX XML Cite \textit{T. Došlić}, J. Math. Chem. 56, No. 9, 2794--2800 (2018; Zbl 1410.92173) Full Text: DOI OpenURL
Daoud, S. N. Number of spanning trees in different products of complete and complete tripartite graphs. (English) Zbl 1474.05046 Ars Comb. 139, 85-103 (2018). MSC: 05C05 05C50 05C76 PDF BibTeX XML Cite \textit{S. N. Daoud}, Ars Comb. 139, 85--103 (2018; Zbl 1474.05046) OpenURL
Király, Zoltán Spanning tree with lower bound on the degrees. (English) Zbl 1384.05070 Discrete Appl. Math. 242, 82-88 (2018). MSC: 05C05 05C07 05C15 05C70 PDF BibTeX XML Cite \textit{Z. Király}, Discrete Appl. Math. 242, 82--88 (2018; Zbl 1384.05070) Full Text: DOI arXiv OpenURL
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 PDF BibTeX XML Cite \textit{F. Ma} and \textit{B. Yao}, Theor. Comput. Sci. 708, 46--57 (2018; Zbl 1383.05054) Full Text: DOI OpenURL
Ma, Fei; Yao, Bing The relations between network-operation and topological-property in a scale-free and small-world network with community structure. (English) Zbl 07544995 Physica A 484, 182-193 (2017). MSC: 82-XX PDF BibTeX XML Cite \textit{F. Ma} and \textit{B. Yao}, Physica A 484, 182--193 (2017; Zbl 07544995) Full Text: DOI OpenURL
Li, Deqiong; Hou, Yaoping The normalized Laplacian spectrum of quadrilateral graphs and its applications. (English) Zbl 1411.05171 Appl. Math. Comput. 297, 180-188 (2017). MSC: 05C50 PDF BibTeX XML Cite \textit{D. Li} and \textit{Y. Hou}, Appl. Math. Comput. 297, 180--188 (2017; Zbl 1411.05171) Full Text: DOI OpenURL
Daoud, S. N. Complexity of graphs generated by wheel graph and their asymptotic limits. (English) Zbl 1378.05198 J. Egypt. Math. Soc. 25, No. 4, 424-433 (2017). MSC: 05C85 05C05 05C50 PDF BibTeX XML Cite \textit{S. N. Daoud}, J. Egypt. Math. Soc. 25, No. 4, 424--433 (2017; Zbl 1378.05198) Full Text: DOI OpenURL
Rodríguez, Ana Alonso; Bertolazzi, Enrico; Ghiloni, Riccardo; Specogna, Ruben Efficient construction of 2-chains with a prescribed boundary. (English) Zbl 1385.55001 SIAM J. Numer. Anal. 55, No. 3, 1159-1187 (2017). Reviewer: Jason Hanson (Redmond) MSC: 55-04 68U05 55N99 52B05 PDF BibTeX XML Cite \textit{A. A. Rodríguez} et al., SIAM J. Numer. Anal. 55, No. 3, 1159--1187 (2017; Zbl 1385.55001) Full Text: DOI arXiv OpenURL
Gong, Helin; Wang, Wei The factorization theorems on the number of spanning trees of graphs with some symmetry. (Chinese. English summary) Zbl 1374.05061 J. Xiamen Univ., Nat. Sci. 55, No. 4, 554-557 (2016). MSC: 05C05 05C10 PDF BibTeX XML Cite \textit{H. Gong} and \textit{W. Wang}, J. Xiamen Univ., Nat. Sci. 55, No. 4, 554--557 (2016; Zbl 1374.05061) Full Text: DOI OpenURL
Ge, Jun; Zhang, Lianzhu Determinant of links, spanning trees, and a theorem of Shank. (English) Zbl 1356.57009 J. Knot Theory Ramifications 25, No. 9, Article ID 1641005, 6 p. (2016). Reviewer: Joel Foisy (Potsdam, NY) MSC: 57M25 57M15 05C10 PDF BibTeX XML Cite \textit{J. Ge} and \textit{L. Zhang}, J. Knot Theory Ramifications 25, No. 9, Article ID 1641005, 6 p. (2016; Zbl 1356.57009) Full Text: DOI OpenURL
Farzad, Babak; Golestanian, Arnoosh; Molloy, Michael Backbone colourings of graphs. (English) Zbl 1339.05131 Discrete Math. 339, No. 11, 2721-2722 (2016). MSC: 05C15 05C05 PDF BibTeX XML Cite \textit{B. Farzad} et al., Discrete Math. 339, No. 11, 2721--2722 (2016; Zbl 1339.05131) Full Text: DOI OpenURL
Becker, Ryan; Glass, Darren B. Cyclic critical groups of graphs. (English) Zbl 1333.05254 Australas. J. Comb. 64, Part 2, 366-375 (2016). MSC: 05C75 05C05 PDF BibTeX XML Cite \textit{R. Becker} and \textit{D. B. Glass}, Australas. J. Comb. 64, Part 2, 366--375 (2016; Zbl 1333.05254) Full Text: arXiv Link OpenURL
Duval, Art M.; Klivans, Caroline J.; Martin, Jeremy L. Cuts and flows of cell complexes. (English) Zbl 1333.05323 J. Algebr. Comb. 41, No. 4, 969-999 (2015). Reviewer: Chen Sheng (Harbin) MSC: 05E45 05C05 05C21 05C50 11H06 11E39 PDF BibTeX XML Cite \textit{A. M. Duval} et al., J. Algebr. Comb. 41, No. 4, 969--999 (2015; Zbl 1333.05323) Full Text: DOI OpenURL
Tien, Joseph H.; Shuai, Zhisheng; Eisenberg, Marisa C.; van den Driessche, P. Disease invasion on community networks with environmental pathogen movement. (English) Zbl 1309.05088 J. Math. Biol. 70, No. 5, 1065-1092 (2015). MSC: 05C20 05C22 05C90 15A09 92D30 PDF BibTeX XML Cite \textit{J. H. Tien} et al., J. Math. Biol. 70, No. 5, 1065--1092 (2015; Zbl 1309.05088) Full Text: DOI OpenURL
Azarija, Jernej Counting graphs with different numbers of spanning trees through the counting of prime partitions. (English) Zbl 1340.05006 Czech. Math. J. 64, No. 1, 31-35 (2014). MSC: 05A16 05C35 PDF BibTeX XML Cite \textit{J. Azarija}, Czech. Math. J. 64, No. 1, 31--35 (2014; Zbl 1340.05006) Full Text: DOI arXiv OpenURL
Nikolopoulos, Stavros D.; Palios, Leonidas; Papadopoulos, Charis Counting spanning trees using modular decomposition. (English) Zbl 1283.05134 Theor. Comput. Sci. 526, 41-57 (2014). MSC: 05C30 05C05 05C85 PDF BibTeX XML Cite \textit{S. D. Nikolopoulos} et al., Theor. Comput. Sci. 526, 41--57 (2014; Zbl 1283.05134) Full Text: DOI Link OpenURL
Xiao, Yuzhi; Zhao, Haixing New method for counting the number of spanning trees in a two-tree network. (English) Zbl 1395.05174 Physica A 392, No. 19, 4576-4583 (2013). MSC: 05C85 05C05 05C82 PDF BibTeX XML Cite \textit{Y. Xiao} and \textit{H. Zhao}, Physica A 392, No. 19, 4576--4583 (2013; Zbl 1395.05174) Full Text: DOI OpenURL
Azarija, Jernej Sharp upper and lower bounds on the number of spanning trees in Cartesian product of graphs. (English) Zbl 1295.05199 Discuss. Math., Graph Theory 33, No. 4, 785-790 (2013). MSC: 05C76 05C05 PDF BibTeX XML Cite \textit{J. Azarija}, Discuss. Math., Graph Theory 33, No. 4, 785--790 (2013; Zbl 1295.05199) Full Text: DOI arXiv OpenURL
Das, Kinkar Ch.; Xu, Kexiang; Liu, Muhuo On sum of powers of the Laplacian eigenvalues of graphs. (English) Zbl 1282.05107 Linear Algebra Appl. 439, No. 11, 3561-3575 (2013). MSC: 05C50 15A18 PDF BibTeX XML Cite \textit{K. Ch. Das} et al., Linear Algebra Appl. 439, No. 11, 3561--3575 (2013; Zbl 1282.05107) Full Text: DOI OpenURL
Ma, Chao; Zhan, Xingzhi Extremal sparsity of the companion matrix of a polynomial. (English) Zbl 1269.15007 Linear Algebra Appl. 438, No. 1, 621-625 (2013). Reviewer: Cyril Fischer (Praha) MSC: 15A18 15A23 11C20 12E05 05C05 05C50 65F50 PDF BibTeX XML Cite \textit{C. Ma} and \textit{X. Zhan}, Linear Algebra Appl. 438, No. 1, 621--625 (2013; Zbl 1269.15007) Full Text: DOI OpenURL
Elsonbaty, A.; Daoud, S. N.; Al-Ahmady, H. Number of spanning trees of some circulant graphs and their asymptotic behavior. (English) Zbl 1348.05052 Int. J. Appl. Math. Stat. 30, No. 6, 93-102 (2012). MSC: 05C05 05C50 PDF BibTeX XML Cite \textit{A. Elsonbaty} et al., Int. J. Appl. Math. Stat. 30, No. 6, 93--102 (2012; Zbl 1348.05052) Full Text: Link OpenURL
Bernardi, Olivier On the spanning trees of the hypercube and other products of graphs. (English) Zbl 1267.05020 Electron. J. Comb. 19, No. 4, Research Paper P51, 16 p. (2012). MSC: 05A15 05A19 05C05 05C30 05C76 05C65 PDF BibTeX XML Cite \textit{O. Bernardi}, Electron. J. Comb. 19, No. 4, Research Paper P51, 16 p. (2012; Zbl 1267.05020) Full Text: arXiv Link OpenURL
Daoud, S. N. Chebyshev polynomials and spanning tree formulas. (English) Zbl 1264.33013 Int. J. Math. Comb. 2012, No. 4, 68-79 (2012). MSC: 33C45 05C50 05C30 PDF BibTeX XML Cite \textit{S. N. Daoud}, Int. J. Math. Comb. 2012, No. 4, 68--79 (2012; Zbl 1264.33013) OpenURL
Bankevich, A. V.; Karpov, D. V. Bounds of the number of leaves of spanning trees. (English. Russian original) Zbl 1256.05107 J. Math. Sci., New York 184, No. 5, 564-572 (2012); translation from Zap. Nauchn. Semin. POMI 391, 18-34 (2011). MSC: 05C30 05C35 05C05 PDF BibTeX XML Cite \textit{A. V. Bankevich} and \textit{D. V. Karpov}, J. Math. Sci., New York 184, No. 5, 564--572 (2012; Zbl 1256.05107); translation from Zap. Nauchn. Semin. POMI 391, 18--34 (2011) Full Text: DOI arXiv OpenURL
Bankevich, A. V. Bounds of the number of leaves of spanning trees in graphs without triangles. (English. Russian original) Zbl 1256.05106 J. Math. Sci., New York 184, No. 5, 557-563 (2012); translation from Zap. Nauchn. Semin. POMI 391, 5-17 (2011). MSC: 05C30 05C35 05C05 PDF BibTeX XML Cite \textit{A. V. Bankevich}, J. Math. Sci., New York 184, No. 5, 557--563 (2012; Zbl 1256.05106); translation from Zap. Nauchn. Semin. POMI 391, 5--17 (2011) Full Text: DOI OpenURL
Ivanov, A. O.; Tuzhilin, A. A. The geometry of inner spanning trees for planar polygons. (English. Russian original) Zbl 1242.05071 Izv. Math. 76, No. 2, 215-244 (2012); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 76, No. 2, 3-36 (2012). MSC: 05C10 05C05 05C35 51M16 52B05 68R10 68U05 PDF BibTeX XML Cite \textit{A. O. Ivanov} and \textit{A. A. Tuzhilin}, Izv. Math. 76, No. 2, 215--244 (2012; Zbl 1242.05071); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 76, No. 2, 3--36 (2012) Full Text: DOI OpenURL
Bonsma, Paul; Zickfeld, Florian Improved bounds for spanning trees with many leaves. (English) Zbl 1238.05053 Discrete Math. 312, No. 6, 1178-1194 (2012). MSC: 05C05 05C35 PDF BibTeX XML Cite \textit{P. Bonsma} and \textit{F. Zickfeld}, Discrete Math. 312, No. 6, 1178--1194 (2012; Zbl 1238.05053) Full Text: DOI OpenURL
Bereg, Sergey; Jiang, Minghui; Yang, Boting; Zhu, Binhai On the red/blue spanning tree problem. (English) Zbl 1216.68116 Theor. Comput. Sci. 412, No. 23, 2459-2467 (2011). MSC: 68Q17 05C05 68U05 PDF BibTeX XML Cite \textit{S. Bereg} et al., Theor. Comput. Sci. 412, No. 23, 2459--2467 (2011; Zbl 1216.68116) Full Text: DOI OpenURL
Har-Peled, Sariel; Sharir, Micha Relative \((p,\varepsilon )\)-approximations in geometry. (English) Zbl 1220.68106 Discrete Comput. Geom. 45, No. 3, 462-496 (2011). Reviewer: Ljubiša Kocić (Niš) MSC: 68U05 65D18 PDF BibTeX XML Cite \textit{S. Har-Peled} and \textit{M. Sharir}, Discrete Comput. Geom. 45, No. 3, 462--496 (2011; Zbl 1220.68106) Full Text: DOI OpenURL
Bidkhori, Hoda; Kishore, Shaunak A bijective proof of a theorem of Knuth. (English) Zbl 1221.05174 Comb. Probab. Comput. 20, No. 1, 11-25 (2011). MSC: 05C20 05C76 05C30 05A15 PDF BibTeX XML Cite \textit{H. Bidkhori} and \textit{S. Kishore}, Comb. Probab. Comput. 20, No. 1, 11--25 (2011; Zbl 1221.05174) Full Text: DOI arXiv OpenURL
Yu, Genzhen The energy and spanning trees of the Aztec diamonds. (English) Zbl 1225.05133 Discrete Math. 311, No. 1, 38-44 (2011). MSC: 05C30 05C50 05C70 05C05 82B20 PDF BibTeX XML Cite \textit{G. Yu}, Discrete Math. 311, No. 1, 38--44 (2011; Zbl 1225.05133) Full Text: DOI OpenURL
Baumgart, Matthias Partitioning bispanning graphs into spanning trees. (English) Zbl 1205.05048 Math. Comput. Sci. 3, No. 1, 3-15 (2010). MSC: 05C05 05A18 05C85 05C70 PDF BibTeX XML Cite \textit{M. Baumgart}, Math. Comput. Sci. 3, No. 1, 3--15 (2010; Zbl 1205.05048) Full Text: DOI Link OpenURL
Sánchez-Soriano, Joaquín; Fragnelli, Vito; Llorca, Natividad; Tijs, Stef Approximate stable solutions in infinite tree problems. (English) Zbl 1203.91023 Optimization 59, No. 7-8, 1123-1137 (2010). MSC: 91A12 91A43 PDF BibTeX XML Cite \textit{J. Sánchez-Soriano} et al., Optimization 59, No. 7--8, 1123--1137 (2010; Zbl 1203.91023) Full Text: DOI OpenURL
Jiang, Leping; Jin, Xian’an On the component number of links corresponding to Sierpiński graphs. (English) Zbl 1200.05063 Int. Math. Forum 5, No. 9-12, 441-447 (2010). MSC: 05C10 57M15 PDF BibTeX XML Cite \textit{L. Jiang} and \textit{X. Jin}, Int. Math. Forum 5, No. 9--12, 441--447 (2010; Zbl 1200.05063) Full Text: Link OpenURL
Atajan, Talip; Yong, Xuerong; Inaba, Hiroshi An efficient approach for counting the number of spanning trees in circulant and related graphs. (English) Zbl 1230.05097 Discrete Math. 310, No. 6-7, 1210-1221 (2010). MSC: 05C05 05C30 PDF BibTeX XML Cite \textit{T. Atajan} et al., Discrete Math. 310, No. 6--7, 1210--1221 (2010; Zbl 1230.05097) Full Text: DOI OpenURL
Li, Jianxi; Shiu, Wai Chee; Chang, An The number of spanning trees of a graph. (English) Zbl 1227.05125 Appl. Math. Lett. 23, No. 3, 286-290 (2010). MSC: 05C05 05C30 05C07 PDF BibTeX XML Cite \textit{J. Li} et al., Appl. Math. Lett. 23, No. 3, 286--290 (2010; Zbl 1227.05125) Full Text: DOI OpenURL
Baumgart, Matthias Partitioning bispanning graphs into spanning trees. (English) Zbl 1235.05111 Miller, Mirka (ed.) et al., Proceedings of the 19th international workshop on combinatorial algorithms, IWOCA 2008, Nagoya, Japan, September 12–15, 2008. London: College Publications (ISBN 978-1-904987-74-1/pbk). Texts in Algorithmics 12, 50-62 (2009). MSC: 05C70 05C05 PDF BibTeX XML Cite \textit{M. Baumgart}, Texts Algorithmics 12, 50--62 (2009; Zbl 1235.05111) OpenURL
Braverman, Mark; Kulkarni, Raghav; Roy, Sambuddha Space-efficient counting in graphs on surfaces. (English) Zbl 1205.05215 Comput. Complexity 18, No. 4, 601-649 (2009). MSC: 05C85 05C30 57M15 68R10 PDF BibTeX XML Cite \textit{M. Braverman} et al., Comput. Complexity 18, No. 4, 601--649 (2009; Zbl 1205.05215) Full Text: DOI Link OpenURL
Nikolopoulos, Stavros D.; Papadopoulos, Charis Counting spanning trees in cographs: an algorithmic approach. (English) Zbl 1224.05240 Ars Comb. 90, 257-274 (2009). MSC: 05C30 05C05 05C85 PDF BibTeX XML Cite \textit{S. D. Nikolopoulos} and \textit{C. Papadopoulos}, Ars Comb. 90, 257--274 (2009; Zbl 1224.05240) OpenURL
Catlin, Paul A.; Lai, Hong-Jian; Shao, Yehong Edge-connectivity and edge-disjoint spanning trees. (English) Zbl 1168.05039 Discrete Math. 309, No. 5, 1033-1040 (2009). Reviewer: William G. Brown (Montréal) MSC: 05C40 05C05 05C45 05C20 PDF BibTeX XML Cite \textit{P. A. Catlin} et al., Discrete Math. 309, No. 5, 1033--1040 (2009; Zbl 1168.05039) Full Text: DOI OpenURL
Zhao, Jihong; Li, Ying; Zhang, Jie The number of spanning trees of a family of plane graph. (Chinese. English summary) Zbl 1199.05049 J. Hunan Univ. Arts Sci., Nat. Sci. 20, No. 3, 16-17, 41 (2008). MSC: 05C05 05C30 PDF BibTeX XML Cite \textit{J. Zhao} et al., J. Hunan Univ. Arts Sci., Nat. Sci. 20, No. 3, 16--17, 41 (2008; Zbl 1199.05049) OpenURL
Feng, Lihua; Yu, Guihai; Jiang, Zhengtao; Ren, Lingzhi Sharp upper bounds for the number of spanning trees of a graph. (English) Zbl 1195.05018 Appl. Anal. Discrete Math. 2, No. 2, 255-259 (2008). Reviewer: Olga Miljković (Beograd) MSC: 05C05 05C50 PDF BibTeX XML Cite \textit{L. Feng} et al., Appl. Anal. Discrete Math. 2, No. 2, 255--259 (2008; Zbl 1195.05018) Full Text: DOI OpenURL
Walikar, H. B.; Ramane, H. S. Laplacian polynomial and number of spanning trees in terms of characteristic polynomial of induced subgraphs. (English) Zbl 1185.05101 AKCE Int. J. Graphs Comb. 5, No. 1, 47-55 (2008). MSC: 05C50 05C05 PDF BibTeX XML Cite \textit{H. B. Walikar} and \textit{H. S. Ramane}, AKCE Int. J. Graphs Comb. 5, No. 1, 47--55 (2008; Zbl 1185.05101) OpenURL
Lyons, Russell; Peled, Ron; Schramm, Oded Growth of the number of spanning trees of the Erdős-Rényi giant component. (English) Zbl 1160.05336 Comb. Probab. Comput. 17, No. 5, 711-726 (2008). MSC: 05C80 05C05 05C30 PDF BibTeX XML Cite \textit{R. Lyons} et al., Comb. Probab. Comput. 17, No. 5, 711--726 (2008; Zbl 1160.05336) Full Text: DOI arXiv OpenURL
Ivanov, A. O.; Tuzhilin, A. A. Immersed polygons and their diagonal triangulations. (English. Russian original) Zbl 1178.05034 Izv. Math. 72, No. 1, 63-90 (2008); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 72, No. 1, 67-98 (2008). Reviewer: Peter McMullen (London) MSC: 05C10 52B05 51M16 05C05 53C42 52B45 PDF BibTeX XML Cite \textit{A. O. Ivanov} and \textit{A. A. Tuzhilin}, Izv. Math. 72, No. 1, 63--90 (2008; Zbl 1178.05034); translation from Izv. Ross. Akad. Nauk, Ser. Mat. 72, No. 1, 67--98 (2008) Full Text: DOI OpenURL
Zickfeld, Florian Geometric and combinatorial structures on graphs. (English) Zbl 1243.05003 Berlin: TU Berlin, Fakultät II, Mathematik und Naturwissenschaften (Diss.). ix, 182 p. (2007). MSC: 05-02 05C10 05A99 52B05 PDF BibTeX XML Cite \textit{F. Zickfeld}, Geometric and combinatorial structures on graphs. Berlin: TU Berlin, Fakultät II, Mathematik und Naturwissenschaften (Diss.) (2007; Zbl 1243.05003) Full Text: Link OpenURL
Zhang, Zhiyong; Zhang, Yuanping The number of spanning trees in some circulant graphs with non-fixed jumps. (Chinese. English summary) Zbl 1150.05318 J. Nat. Sci. Hunan Norm. Univ. 30, No. 3, 18-21 (2007). MSC: 05C05 PDF BibTeX XML Cite \textit{Z. Zhang} and \textit{Y. Zhang}, J. Nat. Sci. Hunan Norm. Univ. 30, No. 3, 18--21 (2007; Zbl 1150.05318) OpenURL
Lotker, Zvi Note on deleting a vertex and weak interlacing of the Laplacian spectrum. (English) Zbl 1142.05342 Electron. J. Linear Algebra 16, 68-72 (2007). MSC: 05C50 PDF BibTeX XML Cite \textit{Z. Lotker}, Electron. J. Linear Algebra 16, 68--72 (2007; Zbl 1142.05342) Full Text: DOI EuDML Link OpenURL
Zou, Hua; Meng, Jixiang Some algebraic properties of Bi-Cayley graphs. (Chinese. English summary) Zbl 1157.05315 Acta Math. Sin., Chin. Ser. 50, No. 5, 1075-1080 (2007). MSC: 05C50 05C25 05C05 05C30 PDF BibTeX XML Cite \textit{H. Zou} and \textit{J. Meng}, Acta Math. Sin., Chin. Ser. 50, No. 5, 1075--1080 (2007; Zbl 1157.05315) OpenURL
Kook, W. Edge-rooted forests and the \(\alpha\)-invariant of cone graphs. (English) Zbl 1116.05019 Discrete Appl. Math. 155, No. 8, 1071-1075 (2007). MSC: 05C05 05B35 11B68 PDF BibTeX XML Cite \textit{W. Kook}, Discrete Appl. Math. 155, No. 8, 1071--1075 (2007; Zbl 1116.05019) Full Text: DOI OpenURL
Nikolopoulos, Stavros D.; Papadopoulos, Charis On the number of spanning trees of \(K^m_n \pm G\) graphs. (English) Zbl 1153.05308 Discrete Math. Theor. Comput. Sci. 8, No. 1, 235-248 (2006). MSC: 05C05 05C30 PDF BibTeX XML Cite \textit{S. D. Nikolopoulos} and \textit{C. Papadopoulos}, Discrete Math. Theor. Comput. Sci. 8, No. 1, 235--248 (2006; Zbl 1153.05308) Full Text: Link OpenURL
Andersen, Lars Døvling; Vestergaard, Preben Dahl; Tuza, Zsott Largest non-unique subgraphs. (English) Zbl 1118.05083 Graphs Comb. 22, No. 4, 453-470 (2006). MSC: 05C75 05C05 05D40 PDF BibTeX XML Cite \textit{L. D. Andersen} et al., Graphs Comb. 22, No. 4, 453--470 (2006; Zbl 1118.05083) Full Text: DOI Link OpenURL
Fekete, Sándor P.; Lübbecke, Marco E.; Meijer, Henk Minimizing the stabbing number of matchings, trees, and triangulations. (English) Zbl 1317.68249 Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11–13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-558-X). 437-446 (2004). MSC: 68U05 05C05 05C70 68Q17 68W25 90C10 90C60 PDF BibTeX XML Cite \textit{S. P. Fekete} et al., in: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11--13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 437--446 (2004; Zbl 1317.68249) OpenURL
Coppersmith, Don; Lotker, Zvi On Cayley’s formula for counting trees in nested interval graphs. (English) Zbl 1062.05070 Electron. J. Linear Algebra 11, 241-245 (2004). Reviewer: Lutz Volkmann (Aachen) MSC: 05C30 05C05 PDF BibTeX XML Cite \textit{D. Coppersmith} and \textit{Z. Lotker}, Electron. J. Linear Algebra 11, 241--245 (2004; Zbl 1062.05070) Full Text: DOI EuDML EMIS Link OpenURL
Fowler, Patrick W. Complexity, spanning trees and relative energies in fullerene isomers. (English) Zbl 1274.05093 MATCH Commun. Math. Comput. Chem. 48, 87-96 (2003). MSC: 05C10 92E10 PDF BibTeX XML Cite \textit{P. W. Fowler}, MATCH Commun. Math. Comput. Chem. 48, 87--96 (2003; Zbl 1274.05093) OpenURL
Huang, Zhenjie A formula for the number of spanning trees of \(K_{n^m}[G]\). (Chinese. English summary) Zbl 0992.05047 J. Zhangzhou Teach. Coll., Nat. Sci. 14, No. 3, 16-20 (2001). MSC: 05C30 05C05 PDF BibTeX XML Cite \textit{Z. Huang}, J. Zhangzhou Teach. Coll., Nat. Sci. 14, No. 3, 16--20 (2001; Zbl 0992.05047) OpenURL
Chen, Xiebin Asymptotic enumeration theorem for the number of spanning trees in grids and tori. (Chinese. English summary) Zbl 0989.05056 J. Zhangzhou Teach. Coll., Nat. Sci. 14, No. 2, 7-12 (2001). MSC: 05C30 05C05 PDF BibTeX XML Cite \textit{X. Chen}, J. Zhangzhou Teach. Coll., Nat. Sci. 14, No. 2, 7--12 (2001; Zbl 0989.05056) OpenURL
Sawionek, Błażej; Wojciechowski, Jacek; Arabas, Jarosław Heuristic approaches to the maximization of the number of spanning trees in regular graphs. (English) Zbl 0968.05073 Bull. Pol. Acad. Sci., Tech. Sci. 48, No. 4, 573-586 (2000). MSC: 05C85 05C30 05C05 68R10 68M15 PDF BibTeX XML Cite \textit{B. Sawionek} et al., Bull. Pol. Acad. Sci., Tech. Sci. 48, No. 4, 573--586 (2000; Zbl 0968.05073) OpenURL
Estivill-Castro, V.; Noy, M.; Urrutia, J. On the chromatic number of tree graphs. (English) Zbl 0969.05025 Discrete Math. 223, No. 1-3, 363-366 (2000). MSC: 05C15 05C05 PDF BibTeX XML Cite \textit{V. Estivill-Castro} et al., Discrete Math. 223, No. 1--3, 363--366 (2000; Zbl 0969.05025) Full Text: DOI OpenURL
Zhang, Yuanping; Yong, Xuerong; Golin, Mordecai J. The number of spanning trees in circulant graphs. (English) Zbl 0969.05036 Discrete Math. 223, No. 1-3, 337-350 (2000). MSC: 05C30 05C05 05C50 PDF BibTeX XML Cite \textit{Y. Zhang} et al., Discrete Math. 223, No. 1--3, 337--350 (2000; Zbl 0969.05036) Full Text: DOI OpenURL
Petingi, L.; Rodriguez, J. On the conjecture that among all graphs on \(n\) nodes and \(e\) edges, one with maximum number of spanning trees must be almost-regular. (English) Zbl 0965.05037 Congr. Numerantium 136, 207-214 (1999). MSC: 05C05 05C35 05C50 05C07 05C75 PDF BibTeX XML Cite \textit{L. Petingi} and \textit{J. Rodriguez}, Congr. Numerantium 136, 207--214 (1999; Zbl 0965.05037) OpenURL
Chung, Fan Spanning trees in subgraphs of lattices. (English) Zbl 0942.05045 Fried, Michael D. (ed.), Applications of curves over finite fields. 1997 AMS-IMS-SIAM joint summer research conference, July 27-31, 1997, Seattle, WA, USA. Providence, RI: American Mathematical Society. Contemp. Math. 245, 201-219 (1999). MSC: 05C50 35P05 46N20 47N20 58J99 PDF BibTeX XML Cite \textit{F. Chung}, Contemp. Math. 245, 201--219 (1999; Zbl 0942.05045) OpenURL
Zhang, Fuji; Yong, Xuerong Asymptotic enumeration theorems for the numbers of spanning trees and Eulerian trails in circulant digraphs and graphs. (English) Zbl 0929.05018 Sci. China, Ser. A 42, No. 3, 264-271 (1999). Reviewer: D.P.Brown (Carbondale) MSC: 05C05 05C30 05A16 05C45 PDF BibTeX XML Cite \textit{F. Zhang} and \textit{X. Yong}, Sci. China, Ser. A 42, No. 3, 264--271 (1999; Zbl 0929.05018) Full Text: DOI OpenURL
Chung, Fan; Yau, S.-T. Coverings, heat kernels and spanning trees. (English) Zbl 0915.05084 Electron. J. Comb. 6, No. 1, Research paper R12, 21 p. (1999); printed version J. Comb. 6, 163-183 (1999). Reviewer: B.K.Dass (Delhi) MSC: 05C50 35P05 58J99 PDF BibTeX XML Cite \textit{F. Chung} and \textit{S. T. Yau}, Electron. J. Comb. 6, No. 1, Research paper R12, 21 p. (1999; Zbl 0915.05084) Full Text: EuDML EMIS OpenURL
Brown, Jason I. Chromatic polynomials and order ideals of monomials. (English) Zbl 0957.05042 Discrete Math. 189, No. 1-3, 43-68 (1998). MSC: 05C15 13P10 PDF BibTeX XML Cite \textit{J. I. Brown}, Discrete Math. 189, No. 1--3, 43--68 (1998; Zbl 0957.05042) Full Text: DOI OpenURL
Cieslik, Dietmar Using Hadwiger numbers in network design. (English) Zbl 0915.05044 Pardalos, Panos M. (ed.) et al., Network design: connectivity and facilities location. DIMACS workshop, April 28–30, 1997. Providence, RI: AMS, American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 59-77 (1998). Reviewer: P.Kirschenhofer (Leoben) MSC: 05C05 52A21 90B18 PDF BibTeX XML Cite \textit{D. Cieslik}, DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 40, 59--77 (1998; Zbl 0915.05044) OpenURL
Bouzette, Sabine; Buekenhout, Francis; Dony, Edmond; Gottcheiner, Alain A theory of nets for polyhedra and polytopes related to incidence geometries. (English) Zbl 0873.52011 Des. Codes Cryptography 10, No. 2, 115-136 (1997). Reviewer: H.Martini (Chemnitz) MSC: 52B05 PDF BibTeX XML Cite \textit{S. Bouzette} et al., Des. Codes Cryptography 10, No. 2, 115--136 (1997; Zbl 0873.52011) Full Text: DOI OpenURL
Kelmans, A. K. Transformations of a graph increasing its Laplacian polynomial and number of spanning trees. (English) Zbl 0873.05065 Eur. J. Comb. 18, No. 1, 35-48 (1997). Reviewer: D.Cvetković (Beograd) MSC: 05C50 05C05 05C30 PDF BibTeX XML Cite \textit{A. K. Kelmans}, Eur. J. Comb. 18, No. 1, 35--48 (1997; Zbl 0873.05065) Full Text: DOI OpenURL
Gilbert, Bryan; Myrvold, Wendy Maximizing spanning trees in almost complete graphs. (English) Zbl 0885.90109 Networks 30, No. 2, 97-104 (1997). MSC: 90C35 PDF BibTeX XML Cite \textit{B. Gilbert} and \textit{W. Myrvold}, Networks 30, No. 2, 97--104 (1997; Zbl 0885.90109) Full Text: DOI OpenURL
Lonc, Zbigniew; Parol, Krzysztof; Wojciechowski, Jacek M. On the asymptotic behavior of the maximum number of spanning trees in circulant graphs. (English) Zbl 0882.05073 Networks 30, No. 1, 47-56 (1997). MSC: 05C30 05C05 68R10 05C35 PDF BibTeX XML Cite \textit{Z. Lonc} et al., Networks 30, No. 1, 47--56 (1997; Zbl 0882.05073) Full Text: DOI OpenURL
Yong, Xuerong; Zhang, Fuji An asymptotic property of the number of spanning trees of double fixed step loop networks. (English) Zbl 0880.05027 Appl. Math., Ser. B (Engl. Ed.) 12, No. 2, 233-236 (1997). MSC: 05C05 05C30 05C38 PDF BibTeX XML Cite \textit{X. Yong} and \textit{F. Zhang}, Appl. Math., Ser. B (Engl. Ed.) 12, No. 2, 233--236 (1997; Zbl 0880.05027) Full Text: DOI OpenURL
Wild, Peter Statistics. (English) Zbl 0873.62076 Beineke, Lowell W. (ed.) et al., Graph connections. Relationships between graph theory and other areas of mathematics. Based on a conference in Milton Keynes, IN, USA, 1994. Oxford: Oxford University Press. Oxf. Lect. Ser. Math. Appl. 5, 208-226 (1997). Reviewer: J.W.Moon (Edmonton) MSC: 62K10 05C90 62K05 PDF BibTeX XML Cite \textit{P. Wild}, Oxf. Lect. Ser. Math. Appl. 5, 208--226 (1997; Zbl 0873.62076) OpenURL
Brown, T. J. N.; Mallion, R. B.; Pollak, P.; Roth, A. Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes. (English) Zbl 0846.05087 Discrete Appl. Math. 67, No. 1-3, 51-66 (1996); erratum ibid. 75, 199-200 (1997). MSC: 05C90 92E10 05C50 05C05 PDF BibTeX XML Cite \textit{T. J. N. Brown} et al., Discrete Appl. Math. 67, No. 1--3, 51--66 (1996; Zbl 0846.05087) Full Text: DOI OpenURL
Hammer, P. L.; Kelmans, A. K. Laplacian spectra and spanning trees of threshold graphs. (English) Zbl 0860.05055 Discrete Appl. Math. 65, No. 1-3, 255-273 (1996). Reviewer: R.I.Tyshkevich (Minsk) MSC: 05C50 05C05 05C30 PDF BibTeX XML Cite \textit{P. L. Hammer} and \textit{A. K. Kelmans}, Discrete Appl. Math. 65, No. 1--3, 255--273 (1996; Zbl 0860.05055) Full Text: DOI Link OpenURL
Entringer, R. C.; Kleitman, D. J.; Székely, L. A. A note on spanning trees with minimum average distance. (English) Zbl 0847.05051 Bull. Inst. Comb. Appl. 17, 71-78 (1996). Reviewer: Ján Plesník (Bratislava) MSC: 05C12 05C05 05C85 68Q25 PDF BibTeX XML Cite \textit{R. C. Entringer} et al., Bull. Inst. Comb. Appl. 17, 71--78 (1996; Zbl 0847.05051) OpenURL
Komlós, J.; Simonovits, M. Szemerédi’s regularity lemma and its applications in graph theory. (English) Zbl 0851.05065 Miklós, D. (ed.) et al., Combinatorics, Paul Erdős is eighty. Vol. 2. Budapest: János Bolyai Mathematical Society. Bolyai Soc. Math. Stud. 2, 295-352 (1996). Reviewer: R.Faudree (Memphis) MSC: 05C35 05C80 05C05 05C10 05C85 05C65 05C70 PDF BibTeX XML Cite \textit{J. Komlós} and \textit{M. Simonovits}, Bolyai Soc. Math. Stud. 2, 295--352 (1996; Zbl 0851.05065) OpenURL
Ding, Guoli Graphs with not too many spanning trees. (English) Zbl 0843.90121 Networks 25, No. 4, 193-197 (1995). MSC: 90C35 PDF BibTeX XML Cite \textit{G. Ding}, Networks 25, No. 4, 193--197 (1995; Zbl 0843.90121) Full Text: DOI OpenURL
Kravtsov, M. K.; Gladkij, A. A. On the number of bases of the transportation problem with prohibitions. (English. Russian original) Zbl 0837.90088 Discrete Math. Appl. 5, No. 3, 187-201 (1995); translation from Diskretn. Mat. 7, No. 2, 3-18 (1995). MSC: 90C08 PDF BibTeX XML Cite \textit{M. K. Kravtsov} and \textit{A. A. Gladkij}, Discrete Math. Appl. 5, No. 3, 187--201 (1995; Zbl 0837.90088); translation from Diskretn. Mat. 7, No. 2, 3--18 (1995) Full Text: DOI OpenURL
Robins, G.; Salowe, J. S. Low-degree minimum spanning trees. (English) Zbl 0827.05020 Discrete Comput. Geom. 14, No. 2, 151-165 (1995). Reviewer: D.Cieslik (Greifswald) MSC: 05C05 52C17 PDF BibTeX XML Cite \textit{G. Robins} and \textit{J. S. Salowe}, Discrete Comput. Geom. 14, No. 2, 151--165 (1995; Zbl 0827.05020) Full Text: DOI EuDML OpenURL
Colbourn, Charles J.; Provan, J. Scott; Vertigan, Dirk A new approach to solving three combinatorial enumeration problems on planar graphs. (English) Zbl 0833.05043 Discrete Appl. Math. 60, No. 1-3, 119-129 (1995). Reviewer: K.R.Parthasarathy (Narayanapuram) MSC: 05C30 05C10 05C70 05C05 05C90 05C85 PDF BibTeX XML Cite \textit{C. J. Colbourn} et al., Discrete Appl. Math. 60, No. 1--3, 119--129 (1995; Zbl 0833.05043) Full Text: DOI OpenURL
Kostochka, A. V. The number of spanning trees in graphs with a given degree sequence. (English) Zbl 0819.05032 Random Struct. Algorithms 6, No. 2-3, 269-274 (1995). Reviewer: J.E.Graver (Syracuse) MSC: 05C30 05C05 05C35 PDF BibTeX XML Cite \textit{A. V. Kostochka}, Random Struct. Algorithms 6, No. 2--3, 269--274 (1995; Zbl 0819.05032) Full Text: DOI Link OpenURL
Rozál, Gregory Paul M.; Hartigan, J. A. The MAP test for multimodality. (English) Zbl 0809.62036 J. Classif. 11, No. 1, 5-36 (1994). MSC: 62G07 62G10 85A35 PDF BibTeX XML Cite \textit{G. P. M. Rozál} and \textit{J. A. Hartigan}, J. Classif. 11, No. 1, 5--36 (1994; Zbl 0809.62036) Full Text: DOI OpenURL
Thomassen, Carsten Trees in triangulations. (English) Zbl 0794.05027 J. Comb. Theory, Ser. B 60, No. 1, 56-62 (1994). MSC: 05C10 05C05 05C38 05C15 PDF BibTeX XML Cite \textit{C. Thomassen}, J. Comb. Theory, Ser. B 60, No. 1, 56--62 (1994; Zbl 0794.05027) Full Text: DOI OpenURL
Glutsyuk, A. A. An analogue of Cayley’s theorem for cyclically symmetric connected graphs with a single cycle that are associated with generalized Lyashko- Looijenga covers. (English. Russian original) Zbl 0820.05031 Russ. Math. Surv. 48, No. 4, 247-248 (1993); translation from Usp. Mat. Nauk 48, No. 4(292), 233-234 (1993). Reviewer: S.C.Althoen (Flint) MSC: 05C30 14N10 05C05 05C38 05C25 PDF BibTeX XML Cite \textit{A. A. Glutsyuk}, Russ. Math. Surv. 48, No. 4, 233--234 (1993; Zbl 0820.05031); translation from Usp. Mat. Nauk 48, No. 4(292), 233--234 (1993) Full Text: DOI OpenURL
Cimikowski, Robert J. Graph planarization and skewness. (English) Zbl 0798.68125 Hoffman, Frederick (ed.) et al., Proceedings of the twenty-third Southeastern international conference on combinatorics, graph theory, and computing, held at Florida Atlantic University, Boca Raton, FL, USA, February 3-7, 1992. Winnipeg: Utilitas Mathematica Publishing Inc.. Congr. Numerantium. 88, 21-32 (1992). MSC: 68R10 05C05 05C10 PDF BibTeX XML Cite \textit{R. J. Cimikowski}, in: Proceedings of the twenty-third Southeastern international conference on combinatorics, graph theory, and computing, held at Florida Atlantic University, Boca Raton, FL, USA, February 3-7, 1992. Winnipeg: Utilitas Mathematica Publishing Inc.. 21--32 (1992; Zbl 0798.68125) OpenURL
Škoviera, Martin Spanning subgraphs of embedded graphs. (English) Zbl 0778.05032 Czech. Math. J. 42, No. 2, 235-239 (1992). Reviewer: A.T.White (Kalamazoo) MSC: 05C10 05C05 PDF BibTeX XML Cite \textit{M. Škoviera}, Czech. Math. J. 42, No. 2, 235--239 (1992; Zbl 0778.05032) Full Text: EuDML OpenURL
Agarwal, Pankaj K.; Sharir, Micha Applications of a new space partitioning technique. (English) Zbl 0766.68131 Algorithms and data structures, Proc. 2nd Workshop, WADS ’91, Ottawa/Can. 1991, Lect. Notes Comput. Sci. 519, 379-391 (1991). MSC: 68U05 68Q25 PDF BibTeX XML Cite \textit{P. K. Agarwal} and \textit{M. Sharir}, Lect. Notes Comput. Sci. 519, 379--391 (1991; Zbl 0766.68131) OpenURL
Lee, Jon Canonical equation sets for classes of concordant polytopes. (English) Zbl 0734.90075 Discrete Appl. Math. 28, No. 3, 207-221 (1990). Reviewer: R.Euler (Brest) MSC: 90C27 05C20 52B05 05C38 52B11 52B12 PDF BibTeX XML Cite \textit{J. Lee}, Discrete Appl. Math. 28, No. 3, 207--221 (1990; Zbl 0734.90075) Full Text: DOI OpenURL
Hashimoto, Ki-ichiro On zeta and L-functions of finite graphs. (English) Zbl 0734.14008 Int. J. Math. 1, No. 4, 381-396 (1990). Reviewer: M.Muro (Yanagido, Gifu) MSC: 14G10 11M99 05C05 PDF BibTeX XML Cite \textit{K.-i. Hashimoto}, Int. J. Math. 1, No. 4, 381--396 (1990; Zbl 0734.14008) Full Text: DOI OpenURL
Lorenzini, D. J. Research problems. (English) Zbl 0715.05036 Discrete Math. 84, No. 3, 327-329 (1990). MSC: 05C30 05C05 05-02 PDF BibTeX XML Cite \textit{D. J. Lorenzini}, Discrete Math. 84, No. 3, 327--329 (1990; Zbl 0715.05036) Full Text: DOI OpenURL
Abu-Sbeih, Mohammed Z. On the number of spanning trees of \(K_ n\) and \(K_{m,n}\). (English) Zbl 0699.05029 Discrete Math. 84, No. 2, 205-207 (1990). MSC: 05C30 05C05 PDF BibTeX XML Cite \textit{M. Z. Abu-Sbeih}, Discrete Math. 84, No. 2, 205--207 (1990; Zbl 0699.05029) Full Text: DOI OpenURL
Hartsfield, N.; Werth, J. S. Spanning trees of the complete bipartite graph. (English) Zbl 0697.05021 Topics in combinatorics and graph theory. Essays in honour of Gerhard Ringel, 339-346 (1990). MSC: 05C05 05C30 PDF BibTeX XML OpenURL
Alon, Noga The number of spanning trees in regular graphs. (English) Zbl 0820.05033 Random Struct. Algorithms 1, No. 2, 175-181 (1990). MSC: 05C30 05C05 PDF BibTeX XML Cite \textit{N. Alon}, Random Struct. Algorithms 1, No. 2, 175--181 (1990; Zbl 0820.05033) Full Text: DOI Link OpenURL
Yao, F. Frances Computational geometry. (English) Zbl 0900.68254 Van Leeuwen, Jan (ed.), Algorithms and complexity. Handbook of theoretical computer science. Vol. A. Amsterdam etc.: Elsevier Science Publishers. 343-389 (1990). MSC: 68Q25 11Y16 94A60 PDF BibTeX XML Cite \textit{F. F. Yao}, in: Algorithms and complexity. Handbook of theoretical computer science. Vol. A. Amsterdam etc.: Elsevier Science Publishers; Cambridge, MA: The MIT Press. 343--389 (1990; Zbl 0900.68254) OpenURL
Griggs, Jerrold R.; Kleitman, Daniel J.; Shastri, Aditya Spanning trees with many leaves in cubic graphs. (English) Zbl 0693.05023 J. Graph Theory 13, No. 6, 669-695 (1989). MSC: 05C05 05C35 PDF BibTeX XML Cite \textit{J. R. Griggs} et al., J. Graph Theory 13, No. 6, 669--695 (1989; Zbl 0693.05023) Full Text: DOI Link OpenURL