Hellmuth, Marc; Scholz, Guillaume E. Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs. (English) Zbl 07781979 Discrete Appl. Math. 343, 25-43 (2024). MSC: 05C70 05C78 05C05 05C75 PDFBibTeX XMLCite \textit{M. Hellmuth} and \textit{G. E. Scholz}, Discrete Appl. Math. 343, 25--43 (2024; Zbl 07781979) Full Text: DOI arXiv
Hartmann, Tim A.; Muluk, Komal Make a graph singly connected by edge orientations. (English) Zbl 07781738 Hsieh, Sun-Yuan (ed.) et al., Combinatorial algorithms. 34th international workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13889, 221-232 (2023). MSC: 68Rxx 68Wxx PDFBibTeX XMLCite \textit{T. A. Hartmann} and \textit{K. Muluk}, Lect. Notes Comput. Sci. 13889, 221--232 (2023; Zbl 07781738) Full Text: DOI arXiv
Banerjee, Sumanta; Chaudhary, Juhi; Pradhan, Dinabandhu Unique response Roman domination: complexity and algorithms. (English) Zbl 07777576 Algorithmica 85, No. 12, 3889-3927 (2023). MSC: 68Wxx 05Cxx PDFBibTeX XMLCite \textit{S. Banerjee} et al., Algorithmica 85, No. 12, 3889--3927 (2023; Zbl 07777576) Full Text: DOI
Lin, Ching-Chi; Ku, Keng-Chu; Hsu, Chan-Hung Paired-domination problem on distance-hereditary graphs. (English) Zbl 1459.05242 Algorithmica 82, No. 10, 2809-2840 (2020). MSC: 05C69 05C70 05C12 05C85 68Q25 PDFBibTeX XMLCite \textit{C.-C. Lin} et al., Algorithmica 82, No. 10, 2809--2840 (2020; Zbl 1459.05242) Full Text: DOI
Agrawal, Akanksha; Lokshtanov, Daniel; Misra, Pranabendu; Saurabh, Saket; Zehavi, Meirav Polylogarithmic approximation algorithms for weighted-\(\mathcal{F}\)-deletion problems. (English) Zbl 1499.68395 Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 1, 15 p. (2018). MSC: 68W25 05C22 05C85 68R10 68W20 PDFBibTeX XMLCite \textit{A. Agrawal} et al., LIPIcs -- Leibniz Int. Proc. Inform. 116, Article 1, 15 p. (2018; Zbl 1499.68395) Full Text: DOI arXiv
Stewart, Lorna; Valenzano, Richard On polygon numbers of circle graphs and distance hereditary graphs. (English) Zbl 1395.05088 Discrete Appl. Math. 248, 3-17 (2018). MSC: 05C35 05C99 PDFBibTeX XMLCite \textit{L. Stewart} and \textit{R. Valenzano}, Discrete Appl. Math. 248, 3--17 (2018; Zbl 1395.05088) Full Text: DOI arXiv
Kanté, Mamadou Moustapha; Kwon, O-joung Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions. (English) Zbl 1394.05024 Eur. J. Comb. 74, 110-139 (2018). MSC: 05C12 05C83 05C38 05B35 52B40 PDFBibTeX XMLCite \textit{M. M. Kanté} and \textit{O-j. Kwon}, Eur. J. Comb. 74, 110--139 (2018; Zbl 1394.05024) Full Text: DOI arXiv
Brešar, Boštjan; Kos, Tim; Nasini, Graciela; Torres, Pablo Total dominating sequences in trees, split graphs, and under modular decomposition. (English) Zbl 1462.05272 Discrete Optim. 28, 16-30 (2018). MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{B. Brešar} et al., Discrete Optim. 28, 16--30 (2018; Zbl 1462.05272) Full Text: DOI arXiv Link
Argiroffo, G.; Leoni, V.; Torres, P. Complexity of \(k\)-tuple total and total \(\{k\}\)-dominations for some subclasses of bipartite graphs. (English) Zbl 1458.05185 Inf. Process. Lett. 138, 75-80 (2018). MSC: 05C69 05C85 68Q17 68Q25 68R10 PDFBibTeX XMLCite \textit{G. Argiroffo} et al., Inf. Process. Lett. 138, 75--80 (2018; Zbl 1458.05185) Full Text: DOI
Lin, Min-Sheng Simple linear-time algorithms for counting independent sets in distance-hereditary graphs. (English) Zbl 1382.05034 Discrete Appl. Math. 239, 144-153 (2018). MSC: 05C30 05C69 05C12 05C85 PDFBibTeX XMLCite \textit{M.-S. Lin}, Discrete Appl. Math. 239, 144--153 (2018; Zbl 1382.05034) Full Text: DOI
Apollonio, Nicola; Franciosa, Paolo Giulio On computing the Galois lattice of bipartite distance hereditary graphs. (English) Zbl 1365.05067 Discrete Appl. Math. 226, 1-9 (2017). MSC: 05C12 06A06 PDFBibTeX XMLCite \textit{N. Apollonio} and \textit{P. G. Franciosa}, Discrete Appl. Math. 226, 1--9 (2017; Zbl 1365.05067) Full Text: DOI arXiv
Moravcik, Gaia; Oellermann, Ortrud R.; Yusim, Samuel Comparing the metric and strong dimensions of graphs. (English) Zbl 1355.05100 Discrete Appl. Math. 220, 68-79 (2017). MSC: 05C12 PDFBibTeX XMLCite \textit{G. Moravcik} et al., Discrete Appl. Math. 220, 68--79 (2017; Zbl 1355.05100) Full Text: DOI
Le, Van Bang; Oversberg, Andrea; Schaudt, Oliver Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs. (English) Zbl 1330.05148 Theor. Comput. Sci. 602, 39-49 (2015). MSC: 05C85 PDFBibTeX XMLCite \textit{V. B. Le} et al., Theor. Comput. Sci. 602, 39--49 (2015; Zbl 1330.05148) Full Text: DOI arXiv
Johnson, Matthew; Paulusma, Daniël; Stewart, Anthony Knocking out \(P_k\)-free graphs. (English) Zbl 1316.05082 Discrete Appl. Math. 190-191, 100-108 (2015). MSC: 05C45 68Q17 PDFBibTeX XMLCite \textit{M. Johnson} et al., Discrete Appl. Math. 190--191, 100--108 (2015; Zbl 1316.05082) Full Text: DOI
Le, Van Bang; Oversberg, Andrea; Schaudt, Oliver Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs. (English) Zbl 1417.05221 Kratsch, Dieter (ed.) et al., Graph-theoretic concepts in computer science. 40th international workshop, WG 2014, Nouan-le-Fuzelier, France, June 25–27, 2014. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 8747, 360-371 (2014). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{V. B. Le} et al., Lect. Notes Comput. Sci. 8747, 360--371 (2014; Zbl 1417.05221) Full Text: DOI arXiv
Gioan, Emeric; Paul, Christophe; Tedder, Marc; Corneil, Derek Practical and efficient split decomposition via graph-labelled trees. (English) Zbl 1303.05191 Algorithmica 69, No. 4, 789-843 (2014). MSC: 05C85 05C70 05C05 05C78 PDFBibTeX XMLCite \textit{E. Gioan} et al., Algorithmica 69, No. 4, 789--843 (2014; Zbl 1303.05191) Full Text: DOI arXiv
Meister, Daniel Clique-width with an inactive label. (English) Zbl 1301.05108 Discrete Math. 337, 34-64 (2014). MSC: 05C12 05C78 05C60 PDFBibTeX XMLCite \textit{D. Meister}, Discrete Math. 337, 34--64 (2014; Zbl 1301.05108) Full Text: DOI
Eschen, Elaine M.; Hoàng, Chính T.; Spinrad, Jeremy P.; Sritharan, R. Finding a sun in building-free graphs. (English) Zbl 1256.05082 Graphs Comb. 28, No. 3, 347-364 (2012). MSC: 05C17 05C85 05C12 68Q17 68R10 PDFBibTeX XMLCite \textit{E. M. Eschen} et al., Graphs Comb. 28, No. 3, 347--364 (2012; Zbl 1256.05082) Full Text: DOI arXiv
Di Stefano, Gabriele Distance-hereditary comparability graphs. (English) Zbl 1254.05155 Discrete Appl. Math. 160, No. 18, 2669-2680 (2012). MSC: 05C70 05C12 05C85 PDFBibTeX XMLCite \textit{G. Di Stefano}, Discrete Appl. Math. 160, No. 18, 2669--2680 (2012; Zbl 1254.05155) Full Text: DOI
Bonomo, Flavia; Faenza, Yuri; Oriolo, Gianpaolo On coloring problems with local constraints. (English) Zbl 1243.05077 Discrete Math. 312, No. 12-13, 2027-2039 (2012). MSC: 05C15 05C69 68Q17 PDFBibTeX XMLCite \textit{F. Bonomo} et al., Discrete Math. 312, No. 12--13, 2027--2039 (2012; Zbl 1243.05077) Full Text: DOI
Gioan, Emeric; Paul, Christophe Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs. (English) Zbl 1236.05162 Discrete Appl. Math. 160, No. 6, 708-733 (2012). MSC: 05C70 05C78 05C05 05C12 PDFBibTeX XMLCite \textit{E. Gioan} and \textit{C. Paul}, Discrete Appl. Math. 160, No. 6, 708--733 (2012; Zbl 1236.05162) Full Text: DOI
Cicerone, Serafino Using split composition to extend distance-hereditary graphs in a generative way (extended abstract). (English) Zbl 1333.05284 Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 286-297 (2011). MSC: 05C85 05C75 PDFBibTeX XMLCite \textit{S. Cicerone}, Lect. Notes Comput. Sci. 6648, 286--297 (2011; Zbl 1333.05284) Full Text: DOI
Lätsch, Martin; Schrader, Rainer Distance-hereditary digraphs. (English) Zbl 1214.05046 J. Discrete Algorithms 8, No. 2, 231-240 (2010). MSC: 05C20 05C12 PDFBibTeX XMLCite \textit{M. Lätsch} and \textit{R. Schrader}, J. Discrete Algorithms 8, No. 2, 231--240 (2010; Zbl 1214.05046) Full Text: DOI
Joeris, Benson L.; Lundberg, Scott; McConnell, Ross M. \(O(m\log n)\) split decomposition of strongly-connected graphs. (English) Zbl 1219.05139 Discrete Appl. Math. 158, No. 7, 779-799 (2010). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{B. L. Joeris} et al., Discrete Appl. Math. 158, No. 7, 779--799 (2010; Zbl 1219.05139) Full Text: DOI
Di Stefano, Gabriele Distance-hereditary comparability graphs. (English) Zbl 1268.05056 Liebling, Thomas M. (ed.) et al., LAGOS’09 – V Latin-American algorithms, graphs, and optimization symposium. Papers from the symposium, Gramado, Brazil, November 3–7, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 35, 227-233 (2009). MSC: 05C12 05C85 PDFBibTeX XMLCite \textit{G. Di Stefano}, Electron. Notes Discrete Math. 35, 227--233 (2009; Zbl 1268.05056) Full Text: DOI
Bonomo, Flavia; Faenza, Yuri; Oriolo, Gianpaolo On coloring problems with local constraints. (English) Zbl 1268.05062 Liebling, Thomas M. (ed.) et al., LAGOS’09 – V Latin-American algorithms, graphs, and optimization symposium. Papers from the symposium, Gramado, Brazil, November 3–7, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 35, 215-220 (2009). MSC: 05C15 05C85 68Q25 PDFBibTeX XMLCite \textit{F. Bonomo} et al., Electron. Notes Discrete Math. 35, 215--220 (2009; Zbl 1268.05062) Full Text: DOI Link
Uehara, Ryuhei; Uno, Yushi Laminar structure of ptolemaic graphs with applications. (English) Zbl 1177.05122 Discrete Appl. Math. 157, No. 7, 1533-1543 (2009). MSC: 05C85 05C45 05C60 05C62 PDFBibTeX XMLCite \textit{R. Uehara} and \textit{Y. Uno}, Discrete Appl. Math. 157, No. 7, 1533--1543 (2009; Zbl 1177.05122) Full Text: DOI
Cornelsen, Sabine; di Stefano, Gabriele Treelike comparability graphs. (English) Zbl 1204.05037 Discrete Appl. Math. 157, No. 8, 1711-1722 (2009). MSC: 05C05 05C70 PDFBibTeX XMLCite \textit{S. Cornelsen} and \textit{G. di Stefano}, Discrete Appl. Math. 157, No. 8, 1711--1722 (2009; Zbl 1204.05037) Full Text: DOI
Rao, Michaël Clique-width of graphs defined by one-vertex extensions. (English) Zbl 1180.05081 Discrete Math. 308, No. 24, 6157-6165 (2008). MSC: 05C69 05C12 05C75 PDFBibTeX XMLCite \textit{M. Rao}, Discrete Math. 308, No. 24, 6157--6165 (2008; Zbl 1180.05081) Full Text: DOI
Rao, Michaël Solving some NP-complete problems using split decomposition. (English) Zbl 1155.05058 Discrete Appl. Math. 156, No. 14, 2768-2780 (2008). MSC: 05C85 05C69 05C70 05C15 68R10 68Q15 PDFBibTeX XMLCite \textit{M. Rao}, Discrete Appl. Math. 156, No. 14, 2768--2780 (2008; Zbl 1155.05058) Full Text: DOI
Eroh, Linda; Oellermann, Ortrud R. Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs. (English) Zbl 1156.05017 Discrete Math. 308, No. 18, 4212-4220 (2008). Reviewer: Frank Plastria (Brussels) MSC: 05C12 PDFBibTeX XMLCite \textit{L. Eroh} and \textit{O. R. Oellermann}, Discrete Math. 308, No. 18, 4212--4220 (2008; Zbl 1156.05017) Full Text: DOI
Gassner, Elisabeth; Hatzl, Johannes A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs. (English) Zbl 1161.05336 Computing 82, No. 2-3, 171-187 (2008). MSC: 05C69 05C85 68R10 PDFBibTeX XMLCite \textit{E. Gassner} and \textit{J. Hatzl}, Computing 82, No. 2--3, 171--187 (2008; Zbl 1161.05336) Full Text: DOI
Chandler, David B.; Chang, Maw-Shang; Kloks, Ton; Le, Van Bang; Peng, Sheng-Lung Probe Ptolemaic graphs. (English) Zbl 1148.05309 Hu, Xiaodong (ed.) et al., Computing and combinatorics. 14th annual international conference, COCOON 2008, Dalian, China, June 27–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-69732-9/pbk). Lecture Notes in Computer Science 5092, 468-477 (2008). MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{D. B. Chandler} et al., Lect. Notes Comput. Sci. 5092, 468--477 (2008; Zbl 1148.05309) Full Text: DOI
Korach, Ephraim; Peled, Uri N.; Rotics, Udi Equistable distance-hereditary graphs. (English) Zbl 1138.05062 Discrete Appl. Math. 156, No. 4, 462-477 (2008). Reviewer: Haiko Müller (Leeds) MSC: 05C75 05C69 05C12 PDFBibTeX XMLCite \textit{E. Korach} et al., Discrete Appl. Math. 156, No. 4, 462--477 (2008; Zbl 1138.05062) Full Text: DOI
Aïder, Méziane Bipartite almost distance-hereditary graphs. (English) Zbl 1131.05078 Discrete Math. 308, No. 5-6, 865-871 (2008). MSC: 05C75 05C12 PDFBibTeX XMLCite \textit{M. Aïder}, Discrete Math. 308, No. 5--6, 865--871 (2008; Zbl 1131.05078) Full Text: DOI
Gioan, Emeric; Paul, Christophe Dynamic distance hereditary graphs using split decomposition. (English) Zbl 1193.68191 Tokuyama, Takeshi (ed.), Algorithms and computation. 18th international symposium, ISAAC 2007, Sendai, Japan, December 17–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77118-0/pbk). Lecture Notes in Computer Science 4835, 41-51 (2007). MSC: 68R10 05C12 PDFBibTeX XMLCite \textit{E. Gioan} and \textit{C. Paul}, Lect. Notes Comput. Sci. 4835, 41--51 (2007; Zbl 1193.68191) Full Text: DOI
Hung, Ruo-Wei; Chang, Maw-Shang Finding a minimum path cover of a distance-hereditary graph in polynomial time. (English) Zbl 1127.05079 Discrete Appl. Math. 155, No. 17, 2242-2256 (2007). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{R.-W. Hung} and \textit{M.-S. Chang}, Discrete Appl. Math. 155, No. 17, 2242--2256 (2007; Zbl 1127.05079) Full Text: DOI
Oellermann, Ortrud R.; Puertas, María Luz Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs. (English) Zbl 1113.05030 Discrete Math. 307, No. 1, 88-96 (2007). Reviewer: Ján Plesník (Bratislava) MSC: 05C12 05C05 05C38 52B40 PDFBibTeX XMLCite \textit{O. R. Oellermann} and \textit{M. L. Puertas}, Discrete Math. 307, No. 1, 88--96 (2007; Zbl 1113.05030) Full Text: DOI
Lee, Chuan-Min; Chang, Maw-Shang Distance-hereditary graphs are clique-perfect. (English) Zbl 1110.68108 Discrete Appl. Math. 154, No. 3, 525-536 (2006). MSC: 68R10 05C12 05C70 05C85 PDFBibTeX XMLCite \textit{C.-M. Lee} and \textit{M.-S. Chang}, Discrete Appl. Math. 154, No. 3, 525--536 (2006; Zbl 1110.68108) Full Text: DOI
Hsieh, Sun-Yuan; Ho, Chin-Wen; Hsu, Tsan-Sheng; Ko, Ming-Tat The Hamiltonian problem on distance-hereditary graphs. (English) Zbl 1095.68084 Discrete Appl. Math. 154, No. 3, 508-524 (2006). MSC: 68R10 05C12 05C45 05C85 68Q25 68W10 PDFBibTeX XMLCite \textit{S.-Y. Hsieh} et al., Discrete Appl. Math. 154, No. 3, 508--524 (2006; Zbl 1095.68084) Full Text: DOI
De Montgolfier, Fabien; Rao, Michaël The bi-join decomposition. (English) Zbl 1200.05168 Raspaud, André (ed.) et al., 7th international colloquium on graph theory, Hyeres, France, September 12–16, 2005. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 22, 173-177 (2005). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{F. De Montgolfier} and \textit{M. Rao}, Electron. Notes Discrete Math. 22, 173--177 (2005; Zbl 1200.05168) Full Text: DOI
Cogis, O.; Thierry, E. Computing maximum stable sets for distance-hereditary graphs. (English) Zbl 1135.05312 Discrete Optim. 2, No. 2, 185-188 (2005). MSC: 05C70 05C12 90C27 PDFBibTeX XMLCite \textit{O. Cogis} and \textit{E. Thierry}, Discrete Optim. 2, No. 2, 185--188 (2005; Zbl 1135.05312) Full Text: DOI
Cáceres, José; Márquez, Alberto; Oellermann, Ortrud R.; Puertas, María Luz Rebuilding convex sets in graphs. (English) Zbl 1070.05035 Discrete Math. 297, No. 1-3, 26-37 (2005). MSC: 05C12 05C75 PDFBibTeX XMLCite \textit{J. Cáceres} et al., Discrete Math. 297, No. 1--3, 26--37 (2005; Zbl 1070.05035) 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
Brandstädt, Andreas; Le, Hoàng-Oanh; Mosca, Raffaele Chordal co-gem-free and (\(P_{5}\),gem)-free graphs have bounded clique-width. (English) Zbl 1084.05056 Discrete Appl. Math. 145, No. 2, 232-241 (2005). MSC: 05C75 68R10 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Discrete Appl. Math. 145, No. 2, 232--241 (2005; Zbl 1084.05056) Full Text: DOI
Cicerone, Serafino; Di Stefano, Gabriele Networks with small stretch number. (English) Zbl 1118.68583 J. Discrete Algorithms 2, No. 4, 383-405 (2004). MSC: 68R10 68M10 05C12 PDFBibTeX XMLCite \textit{S. Cicerone} and \textit{G. Di Stefano}, J. Discrete Algorithms 2, No. 4, 383--405 (2004; Zbl 1118.68583) Full Text: DOI
Cicerone, Serafino; Di Stefano, Gabriele (\(k,+\))-distance-hereditary graphs. (English) Zbl 1074.68042 J. Discrete Algorithms 1, No. 3-4, 281-302 (2003). MSC: 68R10 05C85 PDFBibTeX XMLCite \textit{S. Cicerone} and \textit{G. Di Stefano}, J. Discrete Algorithms 1, No. 3--4, 281--302 (2003; Zbl 1074.68042) Full Text: DOI
Gavoille, Cyril; Paul, Christophe Distance labeling scheme and split decomposition. (English) Zbl 1029.05136 Discrete Math. 273, No. 1-3, 115-130 (2003). MSC: 05C78 05C70 05E30 PDFBibTeX XMLCite \textit{C. Gavoille} and \textit{C. Paul}, Discrete Math. 273, No. 1--3, 115--130 (2003; Zbl 1029.05136) Full Text: DOI
Dahlhaus, E.; Dankelmann, P.; Goddard, W.; Swart, H. C. MAD trees and distance-hereditary graphs. (English) Zbl 1022.05023 Discrete Appl. Math. 131, No. 1, 151-167 (2003). MSC: 05C12 05C05 05C85 PDFBibTeX XMLCite \textit{E. Dahlhaus} et al., Discrete Appl. Math. 131, No. 1, 151--167 (2003; Zbl 1022.05023) Full Text: DOI
Lu, Chin Lung; Tang, Chuan Yi Weighted efficient domination problem on some perfect graphs. (English) Zbl 0994.05111 Discrete Appl. Math. 117, No. 1-3, 163-182 (2002). Reviewer: Bohdan Zelinka (Liberec) MSC: 05C69 05C17 PDFBibTeX XMLCite \textit{C. L. Lu} and \textit{C. Y. Tang}, Discrete Appl. Math. 117, No. 1--3, 163--182 (2002; Zbl 0994.05111) Full Text: DOI
Damiand, G.; Habib, M.; Paul, C. A simple paradigm for graph recognition: Application to cographs and distance hereditary graphs. (English) Zbl 0972.05046 Theor. Comput. Sci. 263, No. 1-2, 99-111 (2001). MSC: 05C85 PDFBibTeX XMLCite \textit{G. Damiand} et al., Theor. Comput. Sci. 263, No. 1--2, 99--111 (2001; Zbl 0972.05046) Full Text: DOI
Yeh, H.-G.; Chang, G. J. Weighted connected \(k\)-domination and weighted \(k\)-dominating clique in distance-hereditary graphs. (English) Zbl 0972.05038 Theor. Comput. Sci. 263, No. 1-2, 3-8 (2001). MSC: 05C69 68R10 05C12 PDFBibTeX XMLCite \textit{H. G. Yeh} and \textit{G. J. Chang}, Theor. Comput. Sci. 263, No. 1--2, 3--8 (2001; Zbl 0972.05038) Full Text: DOI
Rusu, Irena; Spinrad, Jeremy Domination graphs: Examples and counterexamples. (English) Zbl 0982.05074 Discrete Appl. Math. 110, No. 2-3, 289-300 (2001). Reviewer: Bohdan Zelinka (Liberec) MSC: 05C69 PDFBibTeX XMLCite \textit{I. Rusu} and \textit{J. Spinrad}, Discrete Appl. Math. 110, No. 2--3, 289--300 (2001; Zbl 0982.05074) Full Text: DOI
Cicerone, Serafino; Di Stefano, Gabriele Graphs with bounded induced distance. (English) Zbl 0965.05040 Discrete Appl. Math. 108, No. 1-2, 3-21 (2001). Reviewer: Lutz Volkmann (Aachen) MSC: 05C12 05C75 05C38 PDFBibTeX XMLCite \textit{S. Cicerone} and \textit{G. Di Stefano}, Discrete Appl. Math. 108, No. 1--2, 3--21 (2001; Zbl 0965.05040) Full Text: DOI
Golumbic, Martin Charles; Rotics, Udi On the clique-width of some perfect graph classes. (English) Zbl 1320.05090 Int. J. Found. Comput. Sci. 11, No. 3, 423-443 (2000). MSC: 05C69 05C75 PDFBibTeX XMLCite \textit{M. C. Golumbic} and \textit{U. Rotics}, Int. J. Found. Comput. Sci. 11, No. 3, 423--443 (2000; Zbl 1320.05090) Full Text: DOI
Dragan, Feodor F.; Nicolai, Falk LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem. (English) Zbl 0940.05024 Discrete Appl. Math. 98, No. 3, 191-207 (2000). Reviewer: H.Müller (Jena) MSC: 05C12 05C85 68R10 PDFBibTeX XMLCite \textit{F. F. Dragan} and \textit{F. Nicolai}, Discrete Appl. Math. 98, No. 3, 191--207 (2000; Zbl 0940.05024) Full Text: DOI
Broersma, H. J.; Dahlhaus, E.; Kloks, T. A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs. (English) Zbl 0940.05064 Discrete Appl. Math. 99, No. 1-3, 367-400 (2000). Reviewer: H.L.Bodlaender (Utrecht) MSC: 05C85 68R10 05C12 05C05 PDFBibTeX XMLCite \textit{H. J. Broersma} et al., Discrete Appl. Math. 99, No. 1--3, 367--400 (2000; Zbl 0940.05064) Full Text: DOI
Yeh, Hong-Gwa; Chang, Gerard J. Weighted connected domination and Steiner trees in distance-hereditary graphs. (English) Zbl 0906.05030 Discrete Appl. Math. 87, No. 1-3, 245-253 (1998). Reviewer: H.Müller (Jena) MSC: 05C35 05C85 05C12 05C05 05C40 68Q25 PDFBibTeX XMLCite \textit{H.-G. Yeh} and \textit{G. J. Chang}, Discrete Appl. Math. 87, No. 1--3, 245--253 (1998; Zbl 0906.05030) Full Text: DOI Link
Prisner, Erich Distance approximating spanning trees. (English) Zbl 1498.05087 Reischuk, Rüdiger (ed.) et al., STACS 97. 14th annual symposium on theoretical aspects of computer science. Lübeck, Germany, February 27 – March 1, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1200, 499-510 (1997). MSC: 05C12 05C05 PDFBibTeX XMLCite \textit{E. Prisner}, Lect. Notes Comput. Sci. 1200, 499--510 (1997; Zbl 1498.05087) Full Text: DOI
Brandstädt, Andreas; Dragan, Feodor F.; Nicolai, Falk Homogeneously orderable graphs. (English) Zbl 0903.68136 Theor. Comput. Sci. 172, No. 1-2, 209-232 (1997). MSC: 68R10 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Theor. Comput. Sci. 172, No. 1--2, 209--232 (1997; Zbl 0903.68136) Full Text: DOI
Bandelt, Hans-Jürgen; Henkmann, Anja; Nicolai, Falk Powers of distance-hereditary graphs. (English) Zbl 0838.05045 Discrete Math. 145, No. 1-3, 37-60 (1995). Reviewer: N.F.Quimpo (Manila) MSC: 05C12 05C38 PDFBibTeX XMLCite \textit{H.-J. Bandelt} et al., Discrete Math. 145, No. 1--3, 37--60 (1995; Zbl 0838.05045) Full Text: DOI
Brandstädt, Andreas; Dragan, Feodor F.; Nicolai, Falk Homogeneously orderable graphs and the Steiner tree problem. (English) Zbl 07810381 Nagl, Manfred (ed.), Graph-theoretic concepts in computer science. 21st international workshop, WG ’95, Aachen, Germany, June 20–22, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 1017, 381-395 (1995). MSC: 68R10 PDFBibTeX XMLCite \textit{A. Brandstädt} et al., Lect. Notes Comput. Sci. 1017, 381--395 (1995; Zbl 07810381) Full Text: DOI
Dahlhaus, Elias Efficient parallel recognition algorithms of cographs and distance hereditary graphs. (English) Zbl 0822.68079 Discrete Appl. Math. 57, No. 1, 29-44 (1995). MSC: 68R10 68W15 68W10 PDFBibTeX XMLCite \textit{E. Dahlhaus}, Discrete Appl. Math. 57, No. 1, 29--44 (1995; Zbl 0822.68079) Full Text: DOI
Dragan, Feodor F. Dominating cliques in distance-hereditary graphs. (English) Zbl 1502.05233 Schmidt, Erik M. (ed.) et al., Algorithm theory – SWAT ’94. 4th Scandinavian workshop on algorithm theory, Aarhus, Denmark, July 6–8, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 824, 370-381 (1994). MSC: 05C85 05C69 05C70 68W40 PDFBibTeX XMLCite \textit{F. F. Dragan}, Lect. Notes Comput. Sci. 824, 370--381 (1994; Zbl 1502.05233) Full Text: DOI
Damaschke, Peter PLA folding in special graph classes. (English) Zbl 0810.68101 Discrete Appl. Math. 51, No. 1-2, 63-74 (1994). MSC: 68R10 68Q25 PDFBibTeX XMLCite \textit{P. Damaschke}, Discrete Appl. Math. 51, No. 1--2, 63--74 (1994; Zbl 0810.68101) Full Text: DOI
Müller, Haiko; Nicolai, Falk Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs. (English) Zbl 0777.68047 Inf. Process. Lett. 46, No. 5, 225-230 (1993). Reviewer: H.Müller MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{H. Müller} and \textit{F. Nicolai}, Inf. Process. Lett. 46, No. 5, 225--230 (1993; Zbl 0777.68047) Full Text: DOI