Henning, Michael A.; Shozi, Zekhaya B. A generalization of Petersen’s matching theorem. (English) Zbl 07643133 Discrete Math. 346, No. 3, Article ID 113263, 7 p. (2023). Reviewer: V. Lokesha (Bangalore) MSC: 05C15 05C07 05C35 05C40 PDF BibTeX XML Cite \textit{M. A. Henning} and \textit{Z. B. Shozi}, Discrete Math. 346, No. 3, Article ID 113263, 7 p. (2023; Zbl 07643133) Full Text: DOI OpenURL
Zhou, Jin-Xin Finite 3-connected-set-homogeneous locally \(2\mathbf{K}_n\) graphs and \(s\)-arc-transitive graphs. (English) Zbl 07637907 J. Comb. Theory, Ser. B 159, 140-174 (2023). MSC: 05C40 05C25 05E18 20B25 PDF BibTeX XML Cite \textit{J.-X. Zhou}, J. Comb. Theory, Ser. B 159, 140--174 (2023; Zbl 07637907) Full Text: DOI arXiv OpenURL
Zhou, Xiao-min; Guan, Xia-xia; Qin, Cheng-fu; Yang, Wei-hua The characterization of graphs with no 2-connected spanning subgraph of \(V_8\) as a minor. (English) Zbl 1500.05058 Acta Math. Appl. Sin., Engl. Ser. 38, No. 4, 902-915 (2022). MSC: 05C83 05C60 52B40 PDF BibTeX XML Cite \textit{X.-m. Zhou} et al., Acta Math. Appl. Sin., Engl. Ser. 38, No. 4, 902--915 (2022; Zbl 1500.05058) Full Text: DOI OpenURL
Chen, Guangting; Chen, Yong; Chen, Zhi-Zhong; Lin, Guohui; Liu, Tian; Zhang, An Approximation algorithms for the maximally balanced connected graph tripartition problem. (English) Zbl 1502.90143 J. Comb. Optim. 44, No. 3, 1753-1773 (2022). MSC: 90C27 90C35 90C59 PDF BibTeX XML Cite \textit{G. Chen} et al., J. Comb. Optim. 44, No. 3, 1753--1773 (2022; Zbl 1502.90143) Full Text: DOI OpenURL
Cutolo, Giovanni On a construction by Giudici and Parker on commuting graphs of groups. (English) Zbl 1496.05071 J. Comb. Theory, Ser. A 192, Article ID 105666, 19 p. (2022). MSC: 05C25 20D60 20F18 05C40 PDF BibTeX XML Cite \textit{G. Cutolo}, J. Comb. Theory, Ser. A 192, Article ID 105666, 19 p. (2022; Zbl 1496.05071) Full Text: DOI OpenURL
Guo, Shu-Guang; Zhang, Rong Sharp upper bounds on the \(Q\)-index of (minimally) 2-connected graphs with given size. (English) Zbl 1496.05090 Discrete Appl. Math. 320, 408-415 (2022). MSC: 05C40 05C12 05C50 05C35 PDF BibTeX XML Cite \textit{S.-G. Guo} and \textit{R. Zhang}, Discrete Appl. Math. 320, 408--415 (2022; Zbl 1496.05090) Full Text: DOI OpenURL
Zhang, Rong; Guo, Shu-Guang Maxima of the Laplacian spectral radius of (minimally) 2-connected graphs with fixed size. (English) Zbl 1493.05202 Linear Algebra Appl. 651, 390-406 (2022). MSC: 05C50 05C40 PDF BibTeX XML Cite \textit{R. Zhang} and \textit{S.-G. Guo}, Linear Algebra Appl. 651, 390--406 (2022; Zbl 1493.05202) Full Text: DOI OpenURL
Casablanca, Rocío M.; Dankelmann, Peter; Goddard, Wayne; Mol, Lucas; Oellermann, Ortrud The maximum average connectivity among all orientations of a graph. (English) Zbl 1491.05115 J. Comb. Optim. 43, No. 3, 543-570 (2022). Reviewer: Yilun Shang (Newcastle) MSC: 05C40 05C10 05C35 PDF BibTeX XML Cite \textit{R. M. Casablanca} et al., J. Comb. Optim. 43, No. 3, 543--570 (2022; Zbl 1491.05115) Full Text: DOI arXiv Link OpenURL
Gómez-Larrañaga, J. C.; González-Acuña, F.; Heil, Wolfgang The number of simply-connected trivalent 2-dimensional stratifolds. (English) Zbl 1487.57020 Topology Appl. 311, Article ID 107957, 9 p. (2022). MSC: 57K20 57Q99 57M05 57M15 PDF BibTeX XML Cite \textit{J. C. Gómez-Larrañaga} et al., Topology Appl. 311, Article ID 107957, 9 p. (2022; Zbl 1487.57020) Full Text: DOI arXiv OpenURL
Ma, Jie; Yang, Tianchi Non-repeated cycle lengths and Sidon sequences. (English) Zbl 1487.05129 Isr. J. Math. 245, No. 2, 639-674 (2021). MSC: 05C30 05C38 05C12 PDF BibTeX XML Cite \textit{J. Ma} and \textit{T. Yang}, Isr. J. Math. 245, No. 2, 639--674 (2021; Zbl 1487.05129) Full Text: DOI arXiv OpenURL
Jaberi, Raed Computing 2-twinless blocks. (English) Zbl 1499.05595 DML, Discrete Math. Lett. 5, 29-33 (2021). MSC: 05C85 05C20 PDF BibTeX XML Cite \textit{R. Jaberi}, DML, Discrete Math. Lett. 5, 29--33 (2021; Zbl 1499.05595) Full Text: DOI arXiv OpenURL
Haddadan, Arash; Newman, Alantha Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes. (English) Zbl 07458652 Discrete Optim. 42, Article ID 100659, 28 p. (2021). MSC: 90C35 05C40 05C70 05C85 90C27 PDF BibTeX XML Cite \textit{A. Haddadan} and \textit{A. Newman}, Discrete Optim. 42, Article ID 100659, 28 p. (2021; Zbl 07458652) Full Text: DOI arXiv OpenURL
Bujtás, Csilla; Henning, Michael A.; Iršič, Vesna; Klavžar, Sandi Total connected domination game. (English) Zbl 1476.05135 Opusc. Math. 41, No. 4, 453-464 (2021). MSC: 05C57 05C69 05C76 91A43 91A05 PDF BibTeX XML Cite \textit{C. Bujtás} et al., Opusc. Math. 41, No. 4, 453--464 (2021; Zbl 1476.05135) Full Text: DOI arXiv OpenURL
Fan, Dandan; Goryainov, Sergey; Lin, Huiqiu On the (signless Laplacian) spectral radius of minimally \(k\)-(edge)-connected graphs for small \(k\). (English) Zbl 1476.05113 Discrete Appl. Math. 305, 154-163 (2021). MSC: 05C50 05C40 05C35 PDF BibTeX XML Cite \textit{D. Fan} et al., Discrete Appl. Math. 305, 154--163 (2021; Zbl 1476.05113) Full Text: DOI OpenURL
Hasunuma, Toru Connectivity keeping trees in \(2\)-connected graphs with girth conditions. (English) Zbl 07390199 Algorithmica 83, No. 9, 2697-2718 (2021). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{T. Hasunuma}, Algorithmica 83, No. 9, 2697--2718 (2021; Zbl 07390199) Full Text: DOI OpenURL
Fajardo-Rojas, Diego; Jonard-Pérez, Natalia A Jordan curve theorem for 2-dimensional tilings. (English) Zbl 1479.54073 Topology Appl. 300, Article ID 107773, 18 p. (2021). Reviewer: Dimitrios Georgiou (Patras) MSC: 54H30 54H99 54D05 52C20 05C10 05C40 68U05 54B15 54D10 PDF BibTeX XML Cite \textit{D. Fajardo-Rojas} and \textit{N. Jonard-Pérez}, Topology Appl. 300, Article ID 107773, 18 p. (2021; Zbl 1479.54073) Full Text: DOI arXiv OpenURL
Du Preez, Brandon Plane graphs with large faces and small diameter. (English) Zbl 1468.05049 Australas. J. Comb. 80, Part 3, 401-418 (2021). MSC: 05C10 05C12 PDF BibTeX XML Cite \textit{B. Du Preez}, Australas. J. Comb. 80, Part 3, 401--418 (2021; Zbl 1468.05049) Full Text: Link OpenURL
Yu, Guanglong; Sun, Lin; Yan, Chao; Wu, Yarong; Zhang, Hailiang Least \(Q\)-eigenvalues of nonbipartite 2-connected graphs. (English) Zbl 1462.05247 Discrete Appl. Math. 297, 71-79 (2021). MSC: 05C50 05C40 05C90 94A20 PDF BibTeX XML Cite \textit{G. Yu} et al., Discrete Appl. Math. 297, 71--79 (2021; Zbl 1462.05247) Full Text: DOI arXiv OpenURL
Wang, Weifan; Hu, Xiaoxue; Wang, Yiqiao Entire coloring of 2-connected plane graphs. (English) Zbl 1461.05097 Eur. J. Comb. 94, Article ID 103286, 16 p. (2021). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{W. Wang} et al., Eur. J. Comb. 94, Article ID 103286, 16 p. (2021; Zbl 1461.05097) Full Text: DOI OpenURL
Jaberi, Raed 2-edge-twinless blocks. (English) Zbl 1461.05100 Bull. Sci. Math. 168, Article ID 102969, 7 p. (2021). MSC: 05C20 05C85 05C40 PDF BibTeX XML Cite \textit{R. Jaberi}, Bull. Sci. Math. 168, Article ID 102969, 7 p. (2021; Zbl 1461.05100) Full Text: DOI arXiv OpenURL
Ras, C. J.; Brazil, M.; Thomas, D. A. Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane. (English) Zbl 1464.68296 Theor. Comput. Sci. 850, 168-184 (2021). MSC: 68R10 68Q17 68U05 PDF BibTeX XML Cite \textit{C. J. Ras} et al., Theor. Comput. Sci. 850, 168--184 (2021; Zbl 1464.68296) Full Text: DOI OpenURL
Susanti, Bety Hayat; Salman, A. N. M.; Simanjuntak, Rinovia The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths. (English) Zbl 1468.05087 Electron. J. Graph Theory Appl. 8, No. 1, 145-156 (2020). MSC: 05C15 05C40 PDF BibTeX XML Cite \textit{B. H. Susanti} et al., Electron. J. Graph Theory Appl. 8, No. 1, 145--156 (2020; Zbl 1468.05087) Full Text: DOI OpenURL
Imrich, Wilfried; Kalinowski, Rafał; Pilśniak, Monika; Woźniak, Mariusz The distinguishing index of connected graphs without pendant edges. (English) Zbl 1464.05152 Ars Math. Contemp. 18, No. 1, 117-126 (2020). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C15 05E18 05C40 PDF BibTeX XML Cite \textit{W. Imrich} et al., Ars Math. Contemp. 18, No. 1, 117--126 (2020; Zbl 1464.05152) Full Text: DOI OpenURL
Huynh, Tony; Joret, Gwenaël; Micek, Piotr; Wood, David R. Seymour’s conjecture on 2-connected graphs of large pathwidth. (English) Zbl 1474.05370 Combinatorica 40, No. 6, 839-868 (2020). Reviewer: Mirko Lepović (Kragujevac) MSC: 05C83 PDF BibTeX XML Cite \textit{T. Huynh} et al., Combinatorica 40, No. 6, 839--868 (2020; Zbl 1474.05370) Full Text: DOI arXiv OpenURL
Hallas, Jamie; Zayed, Mohra; Zhang, Ping On tree-connection of generalized line graphs. (English) Zbl 1459.05280 J. Comb. Math. Comb. Comput. 114, 3-16 (2020). MSC: 05C76 PDF BibTeX XML Cite \textit{J. Hallas} et al., J. Comb. Math. Comb. Comput. 114, 3--16 (2020; Zbl 1459.05280) OpenURL
Gómez-Larrañaga, J. C.; González-Acuña, F.; Heil, Wolfgang Models of simply-connected trivalent 2-dimensional stratifolds. (English) Zbl 1456.57014 Bol. Soc. Mat. Mex., III. Ser. 26, No. 3, 1301-1312 (2020). MSC: 57K20 57M05 57N80 57M15 PDF BibTeX XML Cite \textit{J. C. Gómez-Larrañaga} et al., Bol. Soc. Mat. Mex., III. Ser. 26, No. 3, 1301--1312 (2020; Zbl 1456.57014) Full Text: DOI OpenURL
Singh, Ranveer Parameterized complexity of determinant and permanent. (English) Zbl 1454.68060 Theor. Comput. Sci. 845, 50-58 (2020). MSC: 68Q27 05C20 05C50 05C85 15A15 PDF BibTeX XML Cite \textit{R. Singh}, Theor. Comput. Sci. 845, 50--58 (2020; Zbl 1454.68060) Full Text: DOI OpenURL
Karpov, D. V. On spanning trees without vertices of degree 2 in plane triangulations. (English. Russian original) Zbl 1448.05036 J. Math. Sci., New York 247, No. 3, 438-441 (2020); translation from Zap. Nauchn. Semin. POMI 475, 93-98 (2018). MSC: 05C05 05C40 05C10 PDF BibTeX XML Cite \textit{D. V. Karpov}, J. Math. Sci., New York 247, No. 3, 438--441 (2020; Zbl 1448.05036); translation from Zap. Nauchn. Semin. POMI 475, 93--98 (2018) Full Text: DOI OpenURL
Georgiadis, Loukas; Italiano, Giuseppe F.; Parotsidis, Nikos Strong connectivity in directed graphs under failures, with applications. (English) Zbl 1448.05116 SIAM J. Comput. 49, No. 5, 865-926 (2020). Reviewer: Yilun Shang (Newcastle) MSC: 05C40 05C20 05C85 PDF BibTeX XML Cite \textit{L. Georgiadis} et al., SIAM J. Comput. 49, No. 5, 865--926 (2020; Zbl 1448.05116) Full Text: DOI OpenURL
Abe, Toshiki; Higa, Junki; Tokunaga, Shin-ichi Domination number of annulus triangulations. (English) Zbl 1447.05151 Theory Appl. Graphs 7, No. 1, Article 6, 16 p. (2020). MSC: 05C69 PDF BibTeX XML Cite \textit{T. Abe} et al., Theory Appl. Graphs 7, No. 1, Article 6, 16 p. (2020; Zbl 1447.05151) Full Text: DOI OpenURL
Ma, Jie; Ning, Bo Stability results on the circumference of a graph. (English) Zbl 1449.05163 Combinatorica 40, No. 1, 105-147 (2020). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C45 05C40 05C35 05C38 05D99 PDF BibTeX XML Cite \textit{J. Ma} and \textit{B. Ning}, Combinatorica 40, No. 1, 105--147 (2020; Zbl 1449.05163) Full Text: DOI arXiv OpenURL
Barrett, Wayne; Evans, Emily J.; Francis, Amanda E.; Kempton, Mark; Sinkovic, John Spanning 2-forests and resistance distance in 2-connected graphs. (English) Zbl 1443.05103 Discrete Appl. Math. 284, 341-352 (2020). MSC: 05C40 05C70 05C12 PDF BibTeX XML Cite \textit{W. Barrett} et al., Discrete Appl. Math. 284, 341--352 (2020; Zbl 1443.05103) Full Text: DOI arXiv OpenURL
Cheriyan, J.; Dippel, J.; Grandoni, F.; Khan, A.; Narayan, V. V. The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm. (English) Zbl 1452.90309 Math. Program. 182, No. 1-2 (A), 315-354 (2020). MSC: 90C35 05C85 68W25 90C59 PDF BibTeX XML Cite \textit{J. Cheriyan} et al., Math. Program. 182, No. 1--2 (A), 315--354 (2020; Zbl 1452.90309) Full Text: DOI arXiv OpenURL
Guo, Shanshan; Huang, Fei; Yuan, Jinjiang Two sufficient conditions for 2-connected graphs to have proper connection number 2. (English) Zbl 1441.05075 Bull. Malays. Math. Sci. Soc. (2) 43, No. 4, 3323-3331 (2020). MSC: 05C15 05C38 05C40 PDF BibTeX XML Cite \textit{S. Guo} et al., Bull. Malays. Math. Sci. Soc. (2) 43, No. 4, 3323--3331 (2020; Zbl 1441.05075) Full Text: DOI OpenURL
Georgiadis, Loukas; Italiano, Giuseppe F.; Karanasiou, Aikaterini Approximating the smallest 2-vertex connected spanning subgraph of a directed graph. (English) Zbl 1448.68355 Theor. Comput. Sci. 807, 185-200 (2020). Reviewer: Vladimír Lacko (Košice) MSC: 68R10 05C20 68W25 68W40 PDF BibTeX XML Cite \textit{L. Georgiadis} et al., Theor. Comput. Sci. 807, 185--200 (2020; Zbl 1448.68355) Full Text: DOI Link OpenURL
Borowiecki, Mieczyslaw; Fiedorowicz, Anna; Sidorowicz, Elzbieta Connected domination game. (English) Zbl 1499.05418 Appl. Anal. Discrete Math. 13, No. 1, 261-289 (2019). MSC: 05C57 05C69 91A43 05C76 PDF BibTeX XML Cite \textit{M. Borowiecki} et al., Appl. Anal. Discrete Math. 13, No. 1, 261--289 (2019; Zbl 1499.05418) Full Text: DOI OpenURL
Mtarneh, S.; Hasni, R.; Akhbari, M. H.; Movahedi, F. Some domination parameters in generalized Jahangir graph \(J_{n,m}\). (English) Zbl 1453.05091 Malays. J. Math. Sci. 13, Spec. Iss.: Conference on Mathematics, Informatics and Statistics (CMIS2018), 113-121 (2019). MSC: 05C69 05C40 PDF BibTeX XML Cite \textit{S. Mtarneh} et al., Malays. J. Math. Sci. 13, 113--121 (2019; Zbl 1453.05091) Full Text: Link OpenURL
Akbari, S.; Ghorban, S. Hossein; Malik, S.; Qajar, S. Conditions for regularity and for 2-connectivity of Toeplitz graphs. (English) Zbl 1427.05052 Util. Math. 110, 305-314 (2019). MSC: 05C07 05C40 PDF BibTeX XML Cite \textit{S. Akbari} et al., Util. Math. 110, 305--314 (2019; Zbl 1427.05052) OpenURL
Liu, Sujuan; Liu, Yinli; Xing, Huaming; An, Mingqiang; Li, Jing The total-rainbow \(k\)-connection of 2-connected graphs. (English) Zbl 1463.05177 Ars Comb. 143, 237-246 (2019). MSC: 05C15 05C40 PDF BibTeX XML Cite \textit{S. Liu} et al., Ars Comb. 143, 237--246 (2019; Zbl 1463.05177) OpenURL
Voblyĭ, V. A. The second Riddell relation and its consequences. (Russian, English) Zbl 1438.05132 Diskretn. Anal. Issled. Oper. 26, No. 1, 20-32 (2019); translation in J. Appl. Ind. Math. 13, No. 1, 168-174 (2019). MSC: 05C30 05C78 PDF BibTeX XML Cite \textit{V. A. Voblyĭ}, Diskretn. Anal. Issled. Oper. 26, No. 1, 20--32 (2019; Zbl 1438.05132); translation in J. Appl. Ind. Math. 13, No. 1, 168--174 (2019) Full Text: DOI OpenURL
Wang, Maoqun; Yang, Weihua Hamiltonicity of 4-connected line graph of a planar graph. (English) Zbl 1438.05153 Adv. Math., Beijing 48, No. 1, 29-34 (2019). MSC: 05C40 05C45 05C10 PDF BibTeX XML Cite \textit{M. Wang} and \textit{W. Yang}, Adv. Math., Beijing 48, No. 1, 29--34 (2019; Zbl 1438.05153) OpenURL
Chen, Xiaodan; Guo, Litao On minimally 2-(edge)-connected graphs with extremal spectral radius. (English) Zbl 1414.05169 Discrete Math. 342, No. 7, 2092-2099 (2019). MSC: 05C40 05C12 05C35 PDF BibTeX XML Cite \textit{X. Chen} and \textit{L. Guo}, Discrete Math. 342, No. 7, 2092--2099 (2019; Zbl 1414.05169) Full Text: DOI OpenURL
Chan, Tsz Lung Contractible and non-contractible non-edges in 2-connected graphs. (English) Zbl 1411.05134 Australas. J. Comb. 73, Part 2, 346-356 (2019). MSC: 05C35 05C12 PDF BibTeX XML Cite \textit{T. L. Chan}, Australas. J. Comb. 73, Part 2, 346--356 (2019; Zbl 1411.05134) Full Text: Link OpenURL
Hua, Hongbo On the peripheral Wiener index of graphs. (English) Zbl 1407.05075 Discrete Appl. Math. 258, 135-142 (2019). MSC: 05C12 05C40 PDF BibTeX XML Cite \textit{H. Hua}, Discrete Appl. Math. 258, 135--142 (2019; Zbl 1407.05075) Full Text: DOI OpenURL
Calamoneri, Tiziana; Dell’Orefice, Matteo; Monti, Angelo A simple linear time algorithm for the locally connected spanning tree problem on maximal planar chordal graphs. (English) Zbl 1417.68147 Theor. Comput. Sci. 764, 2-14 (2019). MSC: 68R10 05C05 68W40 PDF BibTeX XML Cite \textit{T. Calamoneri} et al., Theor. Comput. Sci. 764, 2--14 (2019; Zbl 1417.68147) Full Text: DOI Link OpenURL
McKee, Terry A. Strongly unichord-free graphs. (English) Zbl 1404.05097 Discuss. Math., Graph Theory 39, No. 2, 365-374 (2019). MSC: 05C38 05C40 05C75 PDF BibTeX XML Cite \textit{T. A. McKee}, Discuss. Math., Graph Theory 39, No. 2, 365--374 (2019; Zbl 1404.05097) Full Text: DOI OpenURL
Haghparast, Nastaran; Kiani, Dariush Edge-connectivity and edges of even factors of graphs. (English) Zbl 1404.05168 Discuss. Math., Graph Theory 39, No. 2, 357-364 (2019). MSC: 05C70 05C45 05C40 05C07 05C38 PDF BibTeX XML Cite \textit{N. Haghparast} and \textit{D. Kiani}, Discuss. Math., Graph Theory 39, No. 2, 357--364 (2019; Zbl 1404.05168) Full Text: DOI OpenURL
Brazil, Marcus; Volz, Marcus; Zachariasen, Martin; Ras, Charl; Thomas, Doreen New pruning rules for the Steiner tree problem and 2-connected Steiner network problem. (English) Zbl 1453.68201 Comput. Geom. 78, 37-49 (2019). MSC: 68U05 68R10 PDF BibTeX XML Cite \textit{M. Brazil} et al., Comput. Geom. 78, 37--49 (2019; Zbl 1453.68201) Full Text: DOI OpenURL
Schmid, Andreas; Schmidt, Jens M. Computing Tutte paths. (English) Zbl 1499.68288 Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 98, 14 p. (2018). MSC: 68R10 05C10 05C38 05C45 05C85 68W40 PDF BibTeX XML Cite \textit{A. Schmid} and \textit{J. M. Schmidt}, LIPIcs -- Leibniz Int. Proc. Inform. 107, Article 98, 14 p. (2018; Zbl 1499.68288) Full Text: DOI arXiv OpenURL
Bleile, Beatrice; Bokor, Imre; Hillman, Jonathan Poincaré duality complexes with highly connected universal cover. (English) Zbl 1408.57024 Algebr. Geom. Topol. 18, No. 7, 3749-3788 (2018). Reviewer: Jonathan Hodgson (Swarthmore) MSC: 57P10 57N65 PDF BibTeX XML Cite \textit{B. Bleile} et al., Algebr. Geom. Topol. 18, No. 7, 3749--3788 (2018; Zbl 1408.57024) Full Text: DOI arXiv OpenURL
Ji, Naidan; Chen, Meirun Graphs with almost all edges in long cycles. (English) Zbl 1402.05054 Graphs Comb. 34, No. 6, 1295-1314 (2018). MSC: 05C12 05C38 05C40 05C35 PDF BibTeX XML Cite \textit{N. Ji} and \textit{M. Chen}, Graphs Comb. 34, No. 6, 1295--1314 (2018; Zbl 1402.05054) Full Text: DOI OpenURL
Schmid, Andreas; Schmidt, Jens M. Computing 2-walks in polynomial time. (English) Zbl 1458.05126 ACM Trans. Algorithms 14, No. 2, Article No. 22, 18 p. (2018). MSC: 05C38 68W40 05C40 05C10 PDF BibTeX XML Cite \textit{A. Schmid} and \textit{J. M. Schmidt}, ACM Trans. Algorithms 14, No. 2, Article No. 22, 18 p. (2018; Zbl 1458.05126) Full Text: DOI Link OpenURL
Lokshtanov, Daniel; Pilipczuk, Michał; Saurabh, Saket Below all subsets for minimal connected dominating set. (English) Zbl 1396.05052 SIAM J. Discrete Math. 32, No. 3, 2332-2345 (2018). MSC: 05C30 05C69 68Q25 PDF BibTeX XML Cite \textit{D. Lokshtanov} et al., SIAM J. Discrete Math. 32, No. 3, 2332--2345 (2018; Zbl 1396.05052) Full Text: DOI arXiv OpenURL
Czap, Július; Jendroľ, Stanislav; Valiska, Juraj Conflict-free connections of graphs. (English) Zbl 1392.05039 Discuss. Math., Graph Theory 38, No. 4, 911-920 (2018). MSC: 05C15 05C40 PDF BibTeX XML Cite \textit{J. Czap} et al., Discuss. Math., Graph Theory 38, No. 4, 911--920 (2018; Zbl 1392.05039) Full Text: DOI OpenURL
McDonald, Jessica; Puleo, Gregory J. The list chromatic index of simple graphs whose odd cycles intersect in at most one edge. (English) Zbl 1378.05069 Discrete Math. 341, No. 3, 713-722 (2018). MSC: 05C15 05C38 PDF BibTeX XML Cite \textit{J. McDonald} and \textit{G. J. Puleo}, Discrete Math. 341, No. 3, 713--722 (2018; Zbl 1378.05069) Full Text: DOI arXiv OpenURL
Su, Jing; Ma, Fei; Yao, Bing Probing equivalent definitions of 2-connected graphs. (Chinese. English summary) Zbl 1389.05089 J. Northeast Norm. Univ., Nat. Sci. Ed. 49, No. 1, 33-37 (2017). MSC: 05C40 05C38 PDF BibTeX XML Cite \textit{J. Su} et al., J. Northeast Norm. Univ., Nat. Sci. Ed. 49, No. 1, 33--37 (2017; Zbl 1389.05089) Full Text: DOI OpenURL
Li, Ming-Hua; Liu, Yan 2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings. (English) Zbl 1378.05168 Acta Math. Appl. Sin., Engl. Ser. 33, No. 4, 1001-1014 (2017). MSC: 05C70 05C35 05C40 65D07 65D17 65D18 PDF BibTeX XML Cite \textit{M.-H. Li} and \textit{Y. Liu}, Acta Math. Appl. Sin., Engl. Ser. 33, No. 4, 1001--1014 (2017; Zbl 1378.05168) Full Text: DOI OpenURL
Su, Jing; Ma, Fei; Yao, Bing Probing equivalent definitions of 2-edge connected graphs. (Chinese. English summary) Zbl 1389.05086 J. East China Norm. Univ., Nat. Sci. Ed. 2017, No. 1, 19-25 (2017). MSC: 05C38 05C82 05C40 PDF BibTeX XML Cite \textit{J. Su} et al., J. East China Norm. Univ., Nat. Sci. Ed. 2017, No. 1, 19--25 (2017; Zbl 1389.05086) Full Text: DOI OpenURL
Brause, Christoph; Doan, Trung Duy; Schiermeyer, Ingo Minimum degree conditions for the proper connection number of graphs. (English) Zbl 1371.05153 Graphs Comb. 33, No. 4, 833-843 (2017). MSC: 05C40 05C35 05C07 05C15 PDF BibTeX XML Cite \textit{C. Brause} et al., Graphs Comb. 33, No. 4, 833--843 (2017; Zbl 1371.05153) Full Text: DOI OpenURL
Jovanovic, Raka; Nishi, Tatsushi; Voß, Stefan A heuristic approach for dividing graphs into bi-connected components with a size constraint. (English) Zbl 1370.90300 J. Heuristics 23, No. 2-3, 111-136 (2017). MSC: 90C59 90C35 05C85 PDF BibTeX XML Cite \textit{R. Jovanovic} et al., J. Heuristics 23, No. 2--3, 111--136 (2017; Zbl 1370.90300) Full Text: DOI arXiv OpenURL
Tian, Runli; An, Mingqiang On 2-factors in 5-cycle connected claw-free graphs. (English) Zbl 1368.05082 Util. Math. 102, 161-168 (2017). MSC: 05C38 05C69 05C40 05C76 PDF BibTeX XML Cite \textit{R. Tian} and \textit{M. An}, Util. Math. 102, 161--168 (2017; Zbl 1368.05082) OpenURL
Huang, Fei; Li, Xueliang; Qin, Zhongmei; Magnant, Colton; Ozeki, Kenta On two conjectures about the proper connection number of graphs. (English) Zbl 1365.05157 Discrete Math. 340, No. 9, 2217-2222 (2017). MSC: 05C40 05C12 05C38 05C15 PDF BibTeX XML Cite \textit{F. Huang} et al., Discrete Math. 340, No. 9, 2217--2222 (2017; Zbl 1365.05157) Full Text: DOI arXiv OpenURL
Engbers, John; Galvin, David Extremal \(H\)-colorings of trees and 2-connected graphs. (English) Zbl 1350.05033 J. Comb. Theory, Ser. B 122, 800-814 (2017). MSC: 05C15 05C05 PDF BibTeX XML Cite \textit{J. Engbers} and \textit{D. Galvin}, J. Comb. Theory, Ser. B 122, 800--814 (2017; Zbl 1350.05033) Full Text: DOI arXiv OpenURL
Brause, Christoph; Doan, Trung Duy; Schiermeyer, Ingo On the minimum degree and the proper connection number of graphs. (English) Zbl 1356.05074 Ceselli, Alberto (ed.) et al., Extended abstracts of the 14th Cologne-Twente workshop on graphs and combinatorial optimization (CTW’16), Gargnano, Italy, June 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 55, 109-112 (2016). MSC: 05C40 05C07 05C35 PDF BibTeX XML Cite \textit{C. Brause} et al., Electron. Notes Discrete Math. 55, 109--112 (2016; Zbl 1356.05074) Full Text: DOI OpenURL
Brause, Christoph; Doan, Trung Duy; Schiermeyer, Ingo Proper connection number 2, connectivity, and forbidden subgraphs. (English) Zbl 1356.05073 Ceselli, Alberto (ed.) et al., Extended abstracts of the 14th Cologne-Twente workshop on graphs and combinatorial optimization (CTW’16), Gargnano, Italy, June 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 55, 105-108 (2016). MSC: 05C40 05C60 PDF BibTeX XML Cite \textit{C. Brause} et al., Electron. Notes Discrete Math. 55, 105--108 (2016; Zbl 1356.05073) Full Text: DOI OpenURL
Klostermeyer, William F.; Lawrence, Mary; MacGillivray, Gary Dynamic dominating sets: the eviction model for eternal domination. (English) Zbl 1368.05112 J. Comb. Math. Comb. Comput. 97, 247-269 (2016). Reviewer: Ngoc Mai Tran (Bonn) MSC: 05C69 05C70 91A05 05C57 PDF BibTeX XML Cite \textit{W. F. Klostermeyer} et al., J. Comb. Math. Comb. Comput. 97, 247--269 (2016; Zbl 1368.05112) OpenURL
Oh, Byung-Geun; Seo, Jeehyeon Strong isoperimetric inequalities and combinatorial curvatures on multiply connected planar graphs. (English) Zbl 1347.05044 Discrete Comput. Geom. 56, No. 3, 558-591 (2016). MSC: 05C10 05C40 05B45 52C20 PDF BibTeX XML Cite \textit{B.-G. Oh} and \textit{J. Seo}, Discrete Comput. Geom. 56, No. 3, 558--591 (2016; Zbl 1347.05044) Full Text: DOI OpenURL
Tang, Baoxiang; Ren, Han The number of perfect matchings in two types of 3-regular graphs. (Chinese. English summary) Zbl 1363.05204 J. Nanjing Norm. Univ., Nat. Sci. Ed. 39, No. 1, 21-24 (2016). MSC: 05C70 05C40 PDF BibTeX XML Cite \textit{B. Tang} and \textit{H. Ren}, J. Nanjing Norm. Univ., Nat. Sci. Ed. 39, No. 1, 21--24 (2016; Zbl 1363.05204) Full Text: DOI OpenURL
Loridant, Benoît; Luo, Jun; Sellami, Tarek; Thuswaldner, Jörg M. On cut sets of attractors of iterated function systems. (English) Zbl 1355.28017 Proc. Am. Math. Soc. 144, No. 10, 4341-4356 (2016). Reviewer: Tomasz Kubiak (Poznan) MSC: 28A80 52C20 54D05 PDF BibTeX XML Cite \textit{B. Loridant} et al., Proc. Am. Math. Soc. 144, No. 10, 4341--4356 (2016; Zbl 1355.28017) Full Text: DOI arXiv OpenURL
Gómez-Larrañaga, J. C.; González-Acuña, F.; Heil, Wolfgang 2-dimensional stratifolds. (English) Zbl 1369.57005 Castrillón López, Marco (ed.) et al., A mathematical tribute to Professor José María Montesinos Amilibia on the occasion of his seventieth birthday. Madrid: Universidad Complutense de Madrid, Facultad de Ciencias Matemáticas, Departamento de Geometría y Topología (ISBN 978-84-608-1684-3/pbk). 395-405 (2016). Reviewer: Riccardo Piergallini (Camerino) MSC: 57M20 57M05 57M15 PDF BibTeX XML Cite \textit{J. C. Gómez-Larrañaga} et al., in: A mathematical tribute to Professor José María Montesinos Amilibia on the occasion of his seventieth birthday. Madrid: Universidad Complutense de Madrid, Facultad de Ciencias Matemáticas, Departamento de Geometría y Topología. 395--405 (2016; Zbl 1369.57005) Full Text: arXiv OpenURL
Gómez-Larrañaga, J. C.; González-Acuña, F.; Heil, Wolfgang 2-dimensional stratifolds homotopy equivalent to \(S^{2}\). (English) Zbl 1375.57005 Topology Appl. 209, 56-62 (2016). Reviewer: Riccardo Piergallini (Camerino) MSC: 57M20 57M15 PDF BibTeX XML Cite \textit{J. C. Gómez-Larrañaga} et al., Topology Appl. 209, 56--62 (2016; Zbl 1375.57005) Full Text: DOI OpenURL
McKee, Terry A. Planarity of strongly chordal graphs. (English) Zbl 1345.05019 Bull. Inst. Comb. Appl. 76, 85-91 (2016). Reviewer: Stelian Mihalas (Timişoara) MSC: 05C10 05C40 PDF BibTeX XML Cite \textit{T. A. McKee}, Bull. Inst. Comb. Appl. 76, 85--91 (2016; Zbl 1345.05019) OpenURL
Boyd, Sylvia; Fu, Yao; Sun, Yu A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges. (English) Zbl 1339.05260 Discrete Appl. Math. 209, 48-58 (2016). MSC: 05C60 05C35 05C40 05C85 68W25 PDF BibTeX XML Cite \textit{S. Boyd} et al., Discrete Appl. Math. 209, 48--58 (2016; Zbl 1339.05260) Full Text: DOI OpenURL
Takazawa, Kenjiro A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs. (English) Zbl 1357.68298 Inf. Process. Lett. 116, No. 9, 550-553 (2016). MSC: 68W25 05C40 05C85 68R10 PDF BibTeX XML Cite \textit{K. Takazawa}, Inf. Process. Lett. 116, No. 9, 550--553 (2016; Zbl 1357.68298) Full Text: DOI OpenURL
Jaberi, Raed On computing the 2-vertex-connected components of directed graphs. (English) Zbl 1333.05136 Discrete Appl. Math. 204, 164-172 (2016). MSC: 05C20 05C40 05C85 68W25 PDF BibTeX XML Cite \textit{R. Jaberi}, Discrete Appl. Math. 204, 164--172 (2016; Zbl 1333.05136) Full Text: DOI arXiv OpenURL
Lu, Hongliang Vertex-coloring edge-weighting of bipartite graphs with two edge weights. (English) Zbl 1330.05081 Discrete Math. Theor. Comput. Sci. 17, No. 3, 1-12 (2016). MSC: 05C22 05C15 05C40 PDF BibTeX XML Cite \textit{H. Lu}, Discrete Math. Theor. Comput. Sci. 17, No. 3, 1--12 (2016; Zbl 1330.05081) Full Text: arXiv Link OpenURL
Brazil, M.; Ras, C. J.; Thomas, D. A. An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes. (English) Zbl 1329.05268 Discrete Appl. Math. 201, 47-69 (2016). MSC: 05C82 68R10 68M10 68U05 PDF BibTeX XML Cite \textit{M. Brazil} et al., Discrete Appl. Math. 201, 47--69 (2016; Zbl 1329.05268) Full Text: DOI arXiv OpenURL
Ma, Jie Cycles with consecutive odd lengths. (English) Zbl 1327.05175 Eur. J. Comb. 52, Part A, 74-78 (2016). MSC: 05C38 05C07 05C40 PDF BibTeX XML Cite \textit{J. Ma}, Eur. J. Comb. 52, Part A, 74--78 (2016; Zbl 1327.05175) Full Text: DOI arXiv OpenURL
Yu, Aimei; Liu, Jianping; Han, Miaomiao; Lai, Hong-Jian On dense strongly \(\mathbb{Z}_{2 s + 1}\)-connected graphs. (English) Zbl 1327.05193 Discrete Math. 339, No. 2, 850-856 (2016). MSC: 05C42 05C40 PDF BibTeX XML Cite \textit{A. Yu} et al., Discrete Math. 339, No. 2, 850--856 (2016; Zbl 1327.05193) Full Text: DOI OpenURL
Tomescu, Ioan; Arshad, Misbah; Jamil, Muhammad Kamran Extremal topological indices for graphs of given connectivity. (English) Zbl 1464.05115 Filomat 29, No. 7, 1639-1643 (2015). MSC: 05C09 05C10 05C92 05C12 05C07 92E10 05C35 PDF BibTeX XML Cite \textit{I. Tomescu} et al., Filomat 29, No. 7, 1639--1643 (2015; Zbl 1464.05115) Full Text: DOI OpenURL
Schmid, Andreas; Schmidt, Jens M. Computing 2-walks in polynomial time. (English) Zbl 1355.68129 Mayr, Ernst W. (ed.) et al., 32nd international symposium on theoretical aspects of computer science, STACS’15, Garching, Germany, March 4–7, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-78-1). LIPIcs – Leibniz International Proceedings in Informatics 30, 676-688 (2015). MSC: 68Q25 05C40 05C85 PDF BibTeX XML Cite \textit{A. Schmid} and \textit{J. M. Schmidt}, LIPIcs -- Leibniz Int. Proc. Inform. 30, 676--688 (2015; Zbl 1355.68129) Full Text: DOI OpenURL
Boyd, Sylvia; Legault, Philippe Toward a 6/5 bound for the minimum cost 2-edge connected subgraph problem. (English) Zbl 1347.05107 Campêlo, Manoel (ed.) et al., LAGOS ’15. Selected papers of the 8th Latin-American algorithms, graphs, and optimization symposium, Praia das Fontes, Beberibe, Brazil, May 11–15, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 50, 427-432, electronic only (2015). MSC: 05C40 05C60 68W25 90C05 PDF BibTeX XML Cite \textit{S. Boyd} and \textit{P. Legault}, Electron. Notes Discrete Math. 50, 427--432 (2015; Zbl 1347.05107) Full Text: DOI arXiv OpenURL
Merker, Martin Decomposing series-parallel graphs into paths of length 3 and triangles. (English) Zbl 1346.05236 Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 367-370, electronic only (2015). MSC: 05C70 05C38 05C12 PDF BibTeX XML Cite \textit{M. Merker}, Electron. Notes Discrete Math. 49, 367--370 (2015; Zbl 1346.05236) Full Text: DOI Link OpenURL
Akbari, Narges; Ashrafi, Ali Reza Note on the power graph of finite simple groups. (English) Zbl 1345.20018 Quasigroups Relat. Syst. 23, No. 2, 165-173 (2015). Reviewer: Anatoli Kondrat’ev (Ekaterinburg) MSC: 20D05 20D06 20D08 05C10 05C25 05C40 PDF BibTeX XML Cite \textit{N. Akbari} and \textit{A. R. Ashrafi}, Quasigroups Relat. Syst. 23, No. 2, 165--173 (2015; Zbl 1345.20018) OpenURL
Bálint, Tomáš; Czap, Július Facial parity 9-edge-coloring of outerplane graphs. (English) Zbl 1326.05034 Graphs Comb. 31, No. 5, 1177-1187 (2015). Reviewer: Wai-Kai Chen (Fremont) MSC: 05C10 05C15 05C40 PDF BibTeX XML Cite \textit{T. Bálint} and \textit{J. Czap}, Graphs Comb. 31, No. 5, 1177--1187 (2015; Zbl 1326.05034) Full Text: DOI OpenURL
Alfuraidan, Monther Rashed The contraction principle for mappings on a modular metric space with a graph. (English) Zbl 1311.54032 Fixed Point Theory Appl. 2015, Paper No. 46, 10 p. (2015). MSC: 54H25 54E40 PDF BibTeX XML Cite \textit{M. R. Alfuraidan}, Fixed Point Theory Appl. 2015, Paper No. 46, 10 p. (2015; Zbl 1311.54032) Full Text: DOI OpenURL
Furuya, Michitaka; Okubo, Yuki Forbidden quadruplets generating a finite set of 2-connected graphs. (English) Zbl 1310.05131 Discrete Math. 338, No. 8, 1277-1283 (2015). MSC: 05C40 05C60 PDF BibTeX XML Cite \textit{M. Furuya} and \textit{Y. Okubo}, Discrete Math. 338, No. 8, 1277--1283 (2015; Zbl 1310.05131) Full Text: DOI OpenURL
Zhou, Xue A new lower bound for the number of perfect matchings of line graph. (English) Zbl 1304.05114 Inf. Process. Lett. 115, No. 2, 269-274 (2015). MSC: 05C70 05C76 05C40 05C30 PDF BibTeX XML Cite \textit{X. Zhou}, Inf. Process. Lett. 115, No. 2, 269--274 (2015; Zbl 1304.05114) Full Text: DOI OpenURL
Tomescu, Ioan Extremal results concerning the general sum-connectivity index in some classes of connected graphs. (English) Zbl 1340.05149 ROMAI J. 10, No. 2, 45-51 (2014). MSC: 05C40 05C12 05C38 05C05 05C90 05C35 PDF BibTeX XML Cite \textit{I. Tomescu}, ROMAI J. 10, No. 2, 45--51 (2014; Zbl 1340.05149) OpenURL
An, Mingqiang; Lai, Hong-Jian; Li, Hao; Su, Guifu; Tian, Runli; Xiong, Liming Two operations on a graph preserving the (non)existence of 2-factors in its line graph. (English) Zbl 1349.05177 Czech. Math. J. 64, No. 4, 1035-1044 (2014). MSC: 05C35 05C38 05C45 05C76 05C40 PDF BibTeX XML Cite \textit{M. An} et al., Czech. Math. J. 64, No. 4, 1035--1044 (2014; Zbl 1349.05177) Full Text: DOI Link OpenURL
Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry Solving the 2-disjoint connected subgraphs problem faster than \(2^n\). (English) Zbl 1306.05125 Algorithmica 70, No. 2, 195-207 (2014). MSC: 05C40 05C60 05C85 68Q25 PDF BibTeX XML Cite \textit{M. Cygan} et al., Algorithmica 70, No. 2, 195--207 (2014; Zbl 1306.05125) Full Text: DOI OpenURL
Sebő, András; Vygen, Jens Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs. (English) Zbl 1340.90201 Combinatorica 34, No. 5, 597-629 (2014). Reviewer: Reinhardt Euler (Brest) MSC: 90C27 90C35 05C85 68R10 PDF BibTeX XML Cite \textit{A. Sebő} and \textit{J. Vygen}, Combinatorica 34, No. 5, 597--629 (2014; Zbl 1340.90201) Full Text: DOI arXiv OpenURL
Chiba, Shuya; Tsugaki, Masao A degree sum condition for the existence of a path-factor. (English) Zbl 1313.05296 Ars Comb. 113, 441-450 (2014). MSC: 05C70 05C40 05C07 05C38 PDF BibTeX XML Cite \textit{S. Chiba} and \textit{M. Tsugaki}, Ars Comb. 113, 441--450 (2014; Zbl 1313.05296) OpenURL
Babu, Jasine; Basavaraju, Manu; Chandran, L. Sunil; Rajendraprasad, Deepak 2-connecting outerplanar graphs without blowing up the pathwidth. (English) Zbl 1383.68058 Theor. Comput. Sci. 554, 119-134 (2014). MSC: 68R10 05C85 68W25 PDF BibTeX XML Cite \textit{J. Babu} et al., Theor. Comput. Sci. 554, 119--134 (2014; Zbl 1383.68058) Full Text: DOI OpenURL
Tomescu, Ioan 2-connected graphs with minimum general sum-connectivity index. (English) Zbl 1297.05135 Discrete Appl. Math. 178, 135-141 (2014). MSC: 05C40 05C07 PDF BibTeX XML Cite \textit{I. Tomescu}, Discrete Appl. Math. 178, 135--141 (2014; Zbl 1297.05135) Full Text: DOI OpenURL
Li, Xueliang; Liu, Sujuan Tight upper bound of the rainbow vertex-connection number for 2-connected graphs. (English) Zbl 1297.05084 Discrete Appl. Math. 173, 62-69 (2014). MSC: 05C15 05C40 PDF BibTeX XML Cite \textit{X. Li} and \textit{S. Liu}, Discrete Appl. Math. 173, 62--69 (2014; Zbl 1297.05084) Full Text: DOI arXiv OpenURL
Ozeki, Kenta; Vrána, Petr 2-edge-Hamiltonian-connectedness of 4-connected plane graphs. (English) Zbl 1296.05116 Eur. J. Comb. 35, 432-448 (2014). MSC: 05C45 05C10 05C85 05C40 PDF BibTeX XML Cite \textit{K. Ozeki} and \textit{P. Vrána}, Eur. J. Comb. 35, 432--448 (2014; Zbl 1296.05116) Full Text: DOI OpenURL
Ferber, Asaf; Hefetz, Dan Weak and strong \(k\)-connectivity games. (English) Zbl 1296.05129 Eur. J. Comb. 35, 169-183 (2014). MSC: 05C57 05C40 05C55 91A43 91A05 PDF BibTeX XML Cite \textit{A. Ferber} and \textit{D. Hefetz}, Eur. J. Comb. 35, 169--183 (2014; Zbl 1296.05129) Full Text: DOI arXiv OpenURL
Wang, Tao Strong chromatic index of \(k\)-degenerate graphs. (English) Zbl 1295.05111 Discrete Math. 330, 17-19 (2014). MSC: 05C15 05C40 PDF BibTeX XML Cite \textit{T. Wang}, Discrete Math. 330, 17--19 (2014; Zbl 1295.05111) Full Text: DOI arXiv OpenURL
Ramachandran, S.; Bhanumathy, P. Reconstruction of pseudographs. (English) Zbl 1293.05225 Util. Math. 93, 117-128 (2014). MSC: 05C60 PDF BibTeX XML Cite \textit{S. Ramachandran} and \textit{P. Bhanumathy}, Util. Math. 93, 117--128 (2014; Zbl 1293.05225) OpenURL