Hörsch, Florian On orientations maximizing total arc-connectivity. (English) Zbl 07748734 Theor. Comput. Sci. 978, Article ID 114176, 17 p. (2023). MSC: 68Qxx PDFBibTeX XMLCite \textit{F. Hörsch}, Theor. Comput. Sci. 978, Article ID 114176, 17 p. (2023; Zbl 07748734) Full Text: DOI arXiv
Bensmail, Julien On the hardness of determining the irregularity strength of graphs. (English) Zbl 07605948 Theor. Comput. Sci. 937, 96-107 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{J. Bensmail}, Theor. Comput. Sci. 937, 96--107 (2022; Zbl 07605948) Full Text: DOI
Czygrinow, Andrzej; Hanćkowiak, Michał; Witkowski, Marcin Distributed distance domination in graphs with no \(K_{2,t}\)-minor. (English) Zbl 07533868 Theor. Comput. Sci. 916, 22-30 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{A. Czygrinow} et al., Theor. Comput. Sci. 916, 22--30 (2022; Zbl 07533868) Full Text: DOI arXiv
Moscarini, Marina Computing a metric basis of a bipartite distance-hereditary graph. (English) Zbl 1518.05051 Theor. Comput. Sci. 900, 20-24 (2022). MSC: 05C12 68Q25 PDFBibTeX XMLCite \textit{M. Moscarini}, Theor. Comput. Sci. 900, 20--24 (2022; Zbl 1518.05051) Full Text: DOI
Li, Xingfu; Yu, Guihai; Klavžar, Sandi; Hu, Jie; Li, Bo The Steiner \(k\)-eccentricity on trees. (English) Zbl 1487.68182 Theor. Comput. Sci. 889, 182-188 (2021). Reviewer: Do Ngoc Diep (Hanoi) MSC: 68R10 05C05 05C12 05C38 05C85 68W40 PDFBibTeX XMLCite \textit{X. Li} et al., Theor. Comput. Sci. 889, 182--188 (2021; Zbl 1487.68182) Full Text: DOI arXiv
Li, He; Zhang, Shumin; Ye, Chengfu; Zhou, Shuming The \(g\)-component connectivity of graphs. (English) Zbl 1514.68222 Theor. Comput. Sci. 889, 96-104 (2021). MSC: 68R10 05C35 05C40 68M15 PDFBibTeX XMLCite \textit{H. Li} et al., Theor. Comput. Sci. 889, 96--104 (2021; Zbl 1514.68222) Full Text: DOI
Huang, Yufei; Hou, Bo; Liu, Wen; Wu, Lidong; Rainwater, Stephen; Gao, Suogang On approximation algorithm for the edge metric dimension problem. (English) Zbl 1486.68255 Theor. Comput. Sci. 853, 2-6 (2021). Reviewer: Aleksa Stankovic (Stockholm) MSC: 68W25 05C12 68R10 90C59 PDFBibTeX XMLCite \textit{Y. Huang} et al., Theor. Comput. Sci. 853, 2--6 (2021; Zbl 1486.68255) Full Text: DOI
Abas, Marcel; Vetrík, Tomáš Metric dimension of Cayley digraphs of split metacyclic groups. (English) Zbl 1439.05067 Theor. Comput. Sci. 809, 61-72 (2020). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C12 05C25 PDFBibTeX XMLCite \textit{M. Abas} and \textit{T. Vetrík}, Theor. Comput. Sci. 809, 61--72 (2020; Zbl 1439.05067) Full Text: DOI
Hakanen, Anni; Junnila, Ville; Laihonen, Tero The solid-metric dimension. (English) Zbl 1436.68241 Theor. Comput. Sci. 806, 156-170 (2020). MSC: 68R10 05C12 68Q17 PDFBibTeX XMLCite \textit{A. Hakanen} et al., Theor. Comput. Sci. 806, 156--170 (2020; Zbl 1436.68241) Full Text: DOI
Alcon, Liliana; Gutierrez, Marisa; Hernando, Carmen; Mora, Mercè; Pelayo, Ignacio M. Neighbor-locating colorings in graphs. (English) Zbl 1442.05054 Theor. Comput. Sci. 806, 144-155 (2020). MSC: 05C15 05C69 05C76 05C75 PDFBibTeX XMLCite \textit{L. Alcon} et al., Theor. Comput. Sci. 806, 144--155 (2020; Zbl 1442.05054) Full Text: DOI arXiv Link
Gutin, Gregory; Ramanujan, M. S.; Reidl, Felix; Wahlström, Magnus Alternative parameterizations of Metric Dimension. (English) Zbl 1436.68146 Theor. Comput. Sci. 806, 133-143 (2020). MSC: 68Q27 05C12 68R10 68W20 PDFBibTeX XMLCite \textit{G. Gutin} et al., Theor. Comput. Sci. 806, 133--143 (2020; Zbl 1436.68146) Full Text: DOI arXiv
Eroh, Linda; Kang, Cong X.; Yi, Eunjeong The connected metric dimension at a vertex of a graph. (English) Zbl 1442.05048 Theor. Comput. Sci. 806, 53-69 (2020). MSC: 05C12 05C10 05C35 68Q25 PDFBibTeX XMLCite \textit{L. Eroh} et al., Theor. Comput. Sci. 806, 53--69 (2020; Zbl 1442.05048) Full Text: DOI arXiv
Estrada-Moreno, Alejandro On the \(k\)-partition dimension of graphs. (English) Zbl 1437.05195 Theor. Comput. Sci. 806, 42-52 (2020). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C70 05C40 PDFBibTeX XMLCite \textit{A. Estrada-Moreno}, Theor. Comput. Sci. 806, 42--52 (2020; Zbl 1437.05195) Full Text: DOI arXiv
Moscarini, Marina Computing a metric basis of a 2-connected bipartite distance-hereditary graph. (English) Zbl 1436.68255 Theor. Comput. Sci. 804, 186-206 (2020). MSC: 68R10 05C12 05C85 68W40 PDFBibTeX XMLCite \textit{M. Moscarini}, Theor. Comput. Sci. 804, 186--206 (2020; Zbl 1436.68255) Full Text: DOI
Jaffke, Lars; Kwon, O-joung; Strømme, Torstein J. F.; Telle, Jan Arne Mim-width. III. Graph powers and generalized distance domination problems. (English) Zbl 1442.05157 Theor. Comput. Sci. 796, 216-236 (2019). MSC: 05C69 05C70 05C12 68Q27 PDFBibTeX XMLCite \textit{L. Jaffke} et al., Theor. Comput. Sci. 796, 216--236 (2019; Zbl 1442.05157) Full Text: DOI
Siddiqui, Hafiz Muhammad Afzal; Hayat, Sakander; Khan, Asad; Imran, Muhammad; Razzaq, Ayesha; Liu, Jia-Bao Resolvability and fault-tolerant resolvability structures of convex polytopes. (English) Zbl 1433.05104 Theor. Comput. Sci. 796, 114-128 (2019). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C12 52B12 68Q17 PDFBibTeX XMLCite \textit{H. M. A. Siddiqui} et al., Theor. Comput. Sci. 796, 114--128 (2019; Zbl 1433.05104) Full Text: DOI
Mohan, Chris Monica; Santhakumar, Samivel; Arockiaraj, Micheal; Liu, Jia-Bao Partition dimension of certain classes of series parallel graphs. (English) Zbl 1425.05130 Theor. Comput. Sci. 778, 47-60 (2019). MSC: 05C70 PDFBibTeX XMLCite \textit{C. M. Mohan} et al., Theor. Comput. Sci. 778, 47--60 (2019; Zbl 1425.05130) Full Text: DOI
Chang, Jou-Ming; Pai, Kung-Jui; Wu, Ro-Yu; Yang, Jinn-Shyong The 4-component connectivity of alternating group networks. (English) Zbl 1417.68150 Theor. Comput. Sci. 766, 38-45 (2019). MSC: 68R10 05C40 PDFBibTeX XMLCite \textit{J.-M. Chang} et al., Theor. Comput. Sci. 766, 38--45 (2019; Zbl 1417.68150) Full Text: DOI arXiv
Foucaud, Florent; Mertzios, George B.; Naserasr, Reza; Parreau, Aline; Valicov, Petru Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (English) Zbl 1358.05216 Theor. Comput. Sci. 668, 43-58 (2017). MSC: 05C69 94B60 94B65 PDFBibTeX XMLCite \textit{F. Foucaud} et al., Theor. Comput. Sci. 668, 43--58 (2017; Zbl 1358.05216) Full Text: DOI arXiv
Hoffmann, Stefan; Elterman, Alina; Wanke, Egon A linear time algorithm for metric dimension of cactus block graphs. (English) Zbl 1339.05388 Theor. Comput. Sci. 630, 43-62 (2016). MSC: 05C85 05C12 05B05 PDFBibTeX XMLCite \textit{S. Hoffmann} et al., Theor. Comput. Sci. 630, 43--62 (2016; Zbl 1339.05388) Full Text: DOI
Zejnilović, Sabina; Mitsche, Dieter; Gomes, João; Sinopoli, Bruno Extending the metric dimension to graphs with missing edges. (English) Zbl 1331.05068 Theor. Comput. Sci. 609, Part 2, 384-394 (2016). MSC: 05C05 05C12 05C35 PDFBibTeX XMLCite \textit{S. Zejnilović} et al., Theor. Comput. Sci. 609, Part 2, 384--394 (2016; Zbl 1331.05068) Full Text: DOI
Carraher, James; Choi, Ilkyoo; Delcourt, Michelle; Erickson, Lawrence H.; West, Douglas B. Locating a robber on a graph via distance queries. (English) Zbl 1258.91041 Theor. Comput. Sci. 463, 54-61 (2012). MSC: 91A43 PDFBibTeX XMLCite \textit{J. Carraher} et al., Theor. Comput. Sci. 463, 54--61 (2012; Zbl 1258.91041) Full Text: DOI
Brandstädt, Andreas; Le, Van Bang Simplicial powers of graphs. (English) Zbl 1192.68473 Theor. Comput. Sci. 410, No. 52, 5443-5454 (2009). MSC: 68R10 PDFBibTeX XMLCite \textit{A. Brandstädt} and \textit{V. B. Le}, Theor. Comput. Sci. 410, No. 52, 5443--5454 (2009; Zbl 1192.68473) Full Text: DOI
Liu, Zi-Long; Tian, Fang; Xu, Jun-Ming Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs. (English) Zbl 1171.68032 Theor. Comput. Sci. 410, No. 38-40, 3804-3813 (2009). MSC: 68R10 05C69 68M15 PDFBibTeX XMLCite \textit{Z.-L. Liu} et al., Theor. Comput. Sci. 410, No. 38--40, 3804--3813 (2009; Zbl 1171.68032) Full Text: DOI
Jonoska, Nataša; Seeman, Nadrian C.; Wu, Gang On existence of reporter strands in DNA-based graph structures. (English) Zbl 1163.68328 Theor. Comput. Sci. 410, No. 15, 1448-1460 (2009). MSC: 68R10 PDFBibTeX XMLCite \textit{N. Jonoska} et al., Theor. Comput. Sci. 410, No. 15, 1448--1460 (2009; Zbl 1163.68328) Full Text: DOI Link
Hung, Ruo-Wei; Chang, Maw-Shang Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs. (English) Zbl 1077.68074 Theor. Comput. Sci. 341, No. 1-3, 411-440 (2005). MSC: 68R10 05C38 05C85 68W05 PDFBibTeX XMLCite \textit{R.-W. Hung} and \textit{M.-S. Chang}, Theor. Comput. Sci. 341, No. 1--3, 411--440 (2005; Zbl 1077.68074) Full Text: DOI