McKee, Terry A. Dualizing distance-hereditary graphs. (English) Zbl 07282957 Discuss. Math., Graph Theory 41, No. 1, 285-296 (2021). MSC: 05C12 05C38 05C75 05C76 PDF BibTeX XML Cite \textit{T. A. McKee}, Discuss. Math., Graph Theory 41, No. 1, 285--296 (2021; Zbl 07282957) Full Text: DOI
Lin, Ching-Chi; Ku, Keng-Chu; Hsu, Chan-Hung Paired-domination problem on distance-hereditary graphs. (English) Zbl 07259195 Algorithmica 82, No. 10, 2809-2840 (2020). MSC: 68W 05C PDF BibTeX XML Cite \textit{C.-C. Lin} et al., Algorithmica 82, No. 10, 2809--2840 (2020; Zbl 07259195) Full Text: DOI
Dragan, Feodor F.; Guarnera, Heather M. Eccentricity function in distance-hereditary graphs. (English) Zbl 07226869 Theor. Comput. Sci. 833, 26-40 (2020). MSC: 05C12 05C85 PDF BibTeX XML Cite \textit{F. F. Dragan} and \textit{H. M. Guarnera}, Theor. Comput. Sci. 833, 26--40 (2020; Zbl 07226869) Full Text: DOI
McKee, Terry A. Distance-hereditary and strongly distance-hereditary graphs. (English) Zbl 1443.05050 Bull. Inst. Comb. Appl. 88, 50-64 (2020). MSC: 05C12 05C75 PDF BibTeX XML Cite \textit{T. A. McKee}, Bull. Inst. Comb. Appl. 88, 50--64 (2020; Zbl 1443.05050) Full Text: Link
Moscarini, Marina On the geodetic iteration number of a graph in which geodesic and monophonic convexities are equivalent. (English) Zbl 1442.05112 Discrete Appl. Math. 283, 142-152 (2020). MSC: 05C38 05C10 05C12 52A01 PDF BibTeX XML Cite \textit{M. Moscarini}, Discrete Appl. Math. 283, 142--152 (2020; Zbl 1442.05112) Full Text: DOI
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 PDF BibTeX XML Cite \textit{M. Moscarini}, Theor. Comput. Sci. 804, 186--206 (2020; Zbl 1436.68255) Full Text: DOI
Priya, P. Devi; Monikandan, S. Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible. (English) Zbl 1429.05055 Indian J. Pure Appl. Math. 50, No. 2, 477-484 (2019). MSC: 05C12 05C75 05C40 PDF BibTeX XML Cite \textit{P. D. Priya} and \textit{S. Monikandan}, Indian J. Pure Appl. Math. 50, No. 2, 477--484 (2019; Zbl 1429.05055) Full Text: DOI
Lumbroso, Jérémie; Shi, Jessica Exponential bounds on graph enumerations from vertex incremental characterizations. (English) Zbl 1433.05158 Nebel, Markus (ed.) et al., Proceedings of the 15th workshop on analytic algorithmics and combinatorics, ANALCO ’18, New Orleans, LA, January 8–9, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 118-132 (2018). MSC: 05C30 PDF BibTeX XML Cite \textit{J. Lumbroso} and \textit{J. Shi}, in: Proceedings of the 15th workshop on analytic algorithmics and combinatorics, ANALCO '18, New Orleans, LA, January 8--9, 2018. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 118--132 (2018; Zbl 1433.05158) Full Text: DOI
Moscarini, Marina; Malvestuto, Francesco M. Two classes of graphs in which some problems related to convexity are efficiently solvable. (English) Zbl 1400.05132 Discrete Math. Algorithms Appl. 10, No. 3, Article ID 1850042, 22 p. (2018). MSC: 05C38 05C12 05C10 05C75 68Q25 PDF BibTeX XML Cite \textit{M. Moscarini} and \textit{F. M. Malvestuto}, Discrete Math. Algorithms Appl. 10, No. 3, Article ID 1850042, 22 p. (2018; Zbl 1400.05132) Full Text: DOI
Eiben, Eduard; Ganian, Robert; Kwon, O-Joung A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. (English) Zbl 1402.68199 J. Comput. Syst. Sci. 97, 121-146 (2018). Reviewer: Vladimír Lacko (Košice) MSC: 68W40 05C12 05C85 PDF BibTeX XML Cite \textit{E. Eiben} et al., J. Comput. Syst. Sci. 97, 121--146 (2018; Zbl 1402.68199) Full Text: DOI
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 PDF BibTeX XML Cite \textit{M. M. Kanté} and \textit{O-j. Kwon}, Eur. J. Comb. 74, 110--139 (2018; Zbl 1394.05024) 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 PDF BibTeX XML Cite \textit{M.-S. Lin}, Discrete Appl. Math. 239, 144--153 (2018; Zbl 1382.05034) Full Text: DOI
McKee, Terry A. Requiring adjacent chords in cycles. (English) Zbl 1380.05168 Discrete Math. Algorithms Appl. 10, No. 1, Article ID 1850003, 7 p. (2018). MSC: 05C75 05C38 05C12 PDF BibTeX XML Cite \textit{T. A. McKee}, Discrete Math. Algorithms Appl. 10, No. 1, Article ID 1850003, 7 p. (2018; Zbl 1380.05168) Full Text: DOI
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter Enumeration and maximum number of minimal connected vertex covers in graphs. (English) Zbl 1373.05008 Eur. J. Comb. 68, 132-147 (2018). MSC: 05A15 05C70 05C40 68Q25 PDF BibTeX XML Cite \textit{P. A. Golovach} et al., Eur. J. Comb. 68, 132--147 (2018; Zbl 1373.05008) 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 PDF BibTeX XML Cite \textit{N. Apollonio} and \textit{P. G. Franciosa}, Discrete Appl. Math. 226, 1--9 (2017; Zbl 1365.05067) Full Text: DOI arXiv
Adler, Isolde; Kanté, Mamadou Moustapha; Kwon, O-joung Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm. (English) Zbl 1361.05036 Algorithmica 78, No. 1, 342-377 (2017). MSC: 05C12 05C83 05C38 05B35 52B40 68R10 PDF BibTeX XML Cite \textit{I. Adler} et al., Algorithmica 78, No. 1, 342--377 (2017; Zbl 1361.05036) Full Text: DOI arXiv
Eiben, Eduard; Ganian, Robert; Kwon, O-joung A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion. (English) Zbl 1398.68228 Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 34, 14 p. (2016). MSC: 68Q25 05C75 68Q17 68R10 PDF BibTeX XML Cite \textit{E. Eiben} et al., LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 34, 14 p. (2016; Zbl 1398.68228) Full Text: DOI
Mulder, Henry Martyn An observation on block graphs. (English) Zbl 1358.05164 Bull. Inst. Comb. Appl. 77, 57-58 (2016). MSC: 05C40 PDF BibTeX XML Cite \textit{H. M. Mulder}, Bull. Inst. Comb. Appl. 77, 57--58 (2016; Zbl 1358.05164)
Chen, Bing; Ning, Bo Hamilton cycles in almost distance-hereditary graphs. (English) Zbl 1346.05134 Open Math. 14, 19-28 (2016). MSC: 05C38 05C45 PDF BibTeX XML Cite \textit{B. Chen} and \textit{B. Ning}, Open Math. 14, 19--28 (2016; Zbl 1346.05134) Full Text: DOI arXiv
Brandstädt, Andreas; Esposito, Simone; Nogueira, Loana T.; Protti, Fábio Clique cycle-transversals in distance-hereditary graphs. (English) Zbl 1339.05084 Discrete Appl. Math. 210, 38-44 (2016). MSC: 05C12 05C38 PDF BibTeX XML Cite \textit{A. Brandstädt} et al., Discrete Appl. Math. 210, 38--44 (2016; Zbl 1339.05084) Full Text: DOI
Kanté, Mamadou Moustapha; Nourine, Lhouari Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs. (English) Zbl 1331.05209 SIAM J. Discrete Math. 30, No. 1, 311-326 (2016). MSC: 05C85 05C12 05C99 52A37 PDF BibTeX XML Cite \textit{M. M. Kanté} and \textit{L. Nourine}, SIAM J. Discrete Math. 30, No. 1, 311--326 (2016; Zbl 1331.05209) Full Text: DOI
Dourado, Mitre C.; Oliveira, Rodolfo A.; Protti, Fábio; Rautenbach, Dieter On the geodetic iteration number of distance-hereditary graphs. (English) Zbl 1327.05089 Discrete Math. 339, No. 2, 489-498 (2016). MSC: 05C12 PDF BibTeX XML Cite \textit{M. C. Dourado} et al., Discrete Math. 339, No. 2, 489--498 (2016; Zbl 1327.05089) Full Text: DOI
Kanté, Mamadou Moustapha; Kim, Eun Jung; Kwon, O-Joung; Paul, Christophe An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion. (English) Zbl 1372.68130 Husfeldt, Thore (ed.) et al., 10th international symposium on parameterized and exact computation, IPEC 2015, Patras, Greece, September 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-92-7). LIPIcs – Leibniz International Proceedings in Informatics 43, 138-150 (2015). MSC: 68Q25 05C85 PDF BibTeX XML Cite \textit{M. M. Kanté} et al., LIPIcs -- Leibniz Int. Proc. Inform. 43, 138--150 (2015; Zbl 1372.68130) Full Text: DOI
Apollonio, Nicola; Caramia, Massimiliano; Franciosa, Paolo Giulio On the Galois lattice of bipartite distance hereditary graphs. (English) Zbl 1365.05244 Kratochvíl, Jan (ed.) et al., Combinatorial algorithms. 25th international workshop, IWOCA 2014, Duluth, MN, USA, October 15–17, 2014. Revised selected papers. Cham: Springer (ISBN 978-3-319-19314-4/pbk; 978-3-319-19315-1/ebook). Lecture Notes in Computer Science 8986, 37-48 (2015). MSC: 05C75 05C69 06C15 PDF BibTeX XML Cite \textit{N. Apollonio} et al., Lect. Notes Comput. Sci. 8986, 37--48 (2015; Zbl 1365.05244) Full Text: DOI arXiv
Apollonio, Nicola; Caramia, Massimiliano; Franciosa, Paolo Giulio On the Galois lattice of bipartite distance hereditary graphs. (English) Zbl 1316.05033 Discrete Appl. Math. 190-191, 13-23 (2015). MSC: 05C75 06C15 PDF BibTeX XML Cite \textit{N. Apollonio} et al., Discrete Appl. Math. 190--191, 13--23 (2015; Zbl 1316.05033) Full Text: DOI
Aboulker, Pierre; Kapadia, Rohan The Chen-Chvátal conjecture for metric spaces induced by distance-hereditary graphs. (English) Zbl 1301.05093 Eur. J. Comb. 43, 1-7 (2015). MSC: 05C12 05C40 PDF BibTeX XML Cite \textit{P. Aboulker} and \textit{R. Kapadia}, Eur. J. Comb. 43, 1--7 (2015; Zbl 1301.05093) 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 PDF BibTeX XML Cite \textit{D. Meister}, Discrete Math. 337, 34--64 (2014; Zbl 1301.05108) Full Text: DOI
McKee, Terry A. Symmetric graph-theoretic roles of two-pairs and chords of cycles. (English) Zbl 1298.05275 Discrete Math. Algorithms Appl. 6, No. 3, Article ID 1450031, 6 p. (2014). MSC: 05C75 05C12 05C38 PDF BibTeX XML Cite \textit{T. A. McKee}, Discrete Math. Algorithms Appl. 6, No. 3, Article ID 1450031, 6 p. (2014; Zbl 1298.05275) Full Text: DOI
Kloks, Ton; Poon, Sheung-Hung; Tsai, Feng-Ren; Wang, Yue-Li On the complexity of the black-and-white coloring problem on some classes of perfect graphs. (English) Zbl 1418.68104 Theor. Comput. Sci. 532, 51-63 (2014). MSC: 68Q25 05C15 05C62 68Q17 PDF BibTeX XML Cite \textit{T. Kloks} et al., Theor. Comput. Sci. 532, 51--63 (2014; Zbl 1418.68104) Full Text: DOI
Kwon, O-joung; Oum, Sang-il Graphs of small rank-width are pivot-minors of graphs of small tree-width. (English) Zbl 1285.05047 Discrete Appl. Math. 168, 108-118 (2014). MSC: 05C12 PDF BibTeX XML Cite \textit{O-j. Kwon} and \textit{S.-i. Oum}, Discrete Appl. Math. 168, 108--118 (2014; Zbl 1285.05047) Full Text: DOI arXiv
Maxová, Jana; Turzík, Daniel Which distance-hereditary graphs are cover-incomparability graphs? (English) Zbl 1286.05039 Discrete Appl. Math. 161, No. 13-14, 2095-2100 (2013). MSC: 05C12 05C75 06A06 PDF BibTeX XML Cite \textit{J. Maxová} and \textit{D. Turzík}, Discrete Appl. Math. 161, No. 13--14, 2095--2100 (2013; Zbl 1286.05039) Full Text: DOI
McKee, Terry A. Requiring pairwise nonadjacent chords in cycles. (English) Zbl 1275.05047 J. Comb. 4, No. 3, 357-372 (2013). MSC: 05C75 PDF BibTeX XML Cite \textit{T. A. McKee}, J. Comb. 4, No. 3, 357--372 (2013; Zbl 1275.05047) Full Text: DOI Link
Changat, Manoj; Lakshmikuttyamma, Anandavally K.; Mathews, Joseph; Peterin, Iztok; Narasimha-Shenoi, Prasanth G.; Seethakuttyamma, Geetha; Špacapan, Simon A forbidden subgraph characterization of some graph classes using betweenness axioms. (English) Zbl 1262.05106 Discrete Math. 313, No. 8, 951-958 (2013). MSC: 05C60 05C12 05C75 PDF BibTeX XML Cite \textit{M. Changat} et al., Discrete Math. 313, No. 8, 951--958 (2013; Zbl 1262.05106) Full Text: DOI
Chang, Maw-Shang; Hung, Ling-Ju; Rossmanith, Peter Recognition of probe distance-hereditary graphs. (English) Zbl 1255.05157 Discrete Appl. Math. 161, No. 3, 336-348 (2013). MSC: 05C75 05C12 PDF BibTeX XML Cite \textit{M.-S. Chang} et al., Discrete Appl. Math. 161, No. 3, 336--348 (2013; Zbl 1255.05157) 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 PDF BibTeX XML Cite \textit{E. M. Eschen} et al., Graphs Comb. 28, No. 3, 347--364 (2012; Zbl 1256.05082) Full Text: DOI
Di Stefano, Gabriele Distance-hereditary comparability graphs. (English) Zbl 1254.05155 Discrete Appl. Math. 160, No. 18, 2669-2680 (2012). MSC: 05C70 05C12 05C85 PDF BibTeX XML Cite \textit{G. Di Stefano}, Discrete Appl. Math. 160, No. 18, 2669--2680 (2012; Zbl 1254.05155) Full Text: DOI
Kloks, Ton; Poon, Sheung-Hung; Ung, Chin-Ting; Wang, Yue-Li Algorithms for the strong chromatic index of Halin graphs, distance-hereditary graphs and maximal outerplanar graphs. (English) Zbl 1364.05073 Gudmundsson, Joachim (ed.) et al., Computing and combinatorics. 18th annual international conference, COCOON 2012, Sydney, Australia, August 20–22, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32240-2/pbk). Lecture Notes in Computer Science 7434, 157-168 (2012). MSC: 05C85 05C15 PDF BibTeX XML Cite \textit{T. Kloks} et al., Lect. Notes Comput. Sci. 7434, 157--168 (2012; Zbl 1364.05073) Full Text: DOI
Kloks, Ton; Poon, Sheung-Hung; Tsai, Feng-Ren; Wang, Yue-Li The black-and-white coloring problem on distance-hereditary graphs and strongly chordal graphs. (English) Zbl 1304.05048 Snoeyink, Jack (ed.) et al., Frontiers in algorithmics and algorithmic aspects in information and management. Joint international conference, FAW-AAIM 2012, Beijing, China, May 14–16, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29699-4/pbk). Lecture Notes in Computer Science 7285, 339-350 (2012). MSC: 05C15 68Q17 68Q25 PDF BibTeX XML Cite \textit{T. Kloks} et al., Lect. Notes Comput. Sci. 7285, 339--350 (2012; Zbl 1304.05048) Full Text: DOI arXiv
McKee, Terry A. Constrained chords in strongly chordal and distance-hereditary graphs. (English) Zbl 1264.05112 Util. Math. 87, 3-12 (2012). MSC: 05C75 05C38 05C12 PDF BibTeX XML Cite \textit{T. A. McKee}, Util. Math. 87, 3--12 (2012; Zbl 1264.05112)
Schaudt, Oliver A note on connected dominating sets of distance-hereditary graphs. (English) Zbl 1239.05142 Discrete Appl. Math. 160, No. 9, 1394-1398 (2012). MSC: 05C69 05C40 05C12 PDF BibTeX XML Cite \textit{O. Schaudt}, Discrete Appl. Math. 160, No. 9, 1394--1398 (2012; Zbl 1239.05142) 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 PDF BibTeX XML Cite \textit{E. Gioan} and \textit{C. Paul}, Discrete Appl. Math. 160, No. 6, 708--733 (2012; Zbl 1236.05162) Full Text: DOI
Cicerone, Serafino Characterizations of graphs with stretch number less than 2. (English) Zbl 1268.05055 Bonomo, Flavia (ed.) et al., LAGOS’11 – VI Latin-American algorithms, graphs, and optimization symposium. Extended abstracts from the symposium, Bariloche, Argentina, March 28–April 1, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 37, 375-380 (2011). MSC: 05C12 05C75 PDF BibTeX XML Cite \textit{S. Cicerone}, Electron. Notes Discrete Math. 37, 375--380 (2011; Zbl 1268.05055) Full Text: DOI
Lee, Chuan-Min Weighted maximum-clique transversal sets of graphs. (English) Zbl 1237.05153 ISRN Discrete Math. 2011, Article ID 540834, 20 p. (2011). MSC: 05C69 68R10 PDF BibTeX XML Cite \textit{C.-M. Lee}, ISRN Discrete Math. 2011, Article ID 540834, 20 p. (2011; Zbl 1237.05153) Full Text: DOI
May, Teresa R.; Oellermann, Ortrud R. The strong dimension of distance-hereditary graphs. (English) Zbl 1233.05097 J. Comb. Math. Comb. Comput. 76, 59-73 (2011). MSC: 05C12 05C85 PDF BibTeX XML Cite \textit{T. R. May} and \textit{O. R. Oellermann}, J. Comb. Math. Comb. Comput. 76, 59--73 (2011; Zbl 1233.05097)
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 PDF BibTeX XML Cite \textit{S. Cicerone}, Lect. Notes Comput. Sci. 6648, 286--297 (2011; Zbl 1333.05284) Full Text: DOI
McKee, Terry A. Pentangulated graphs. (English) Zbl 1223.05249 AKCE Int. J. Graphs Comb. 7, No. 2, 113-119 (2010). MSC: 05C75 05C38 PDF BibTeX XML Cite \textit{T. A. McKee}, AKCE Int. J. Graphs Comb. 7, No. 2, 113--119 (2010; Zbl 1223.05249)
Lee, Chuan-Min Variations of maximum-clique transversal sets on graphs. (English) Zbl 1235.90175 Ann. Oper. Res. 181, 21-66 (2010). MSC: 90C35 PDF BibTeX XML Cite \textit{C.-M. Lee}, Ann. Oper. Res. 181, 21--66 (2010; Zbl 1235.90175) Full Text: DOI
Lakshmanan S., Aparna; Vijayakumar, A. On weakly clique irreducible graphs. (English) Zbl 1200.05190 Bull. Inst. Comb. Appl. 58, 48-58 (2010). MSC: 05C75 05C69 05C35 PDF BibTeX XML Cite \textit{A. Lakshmanan S.} and \textit{A. Vijayakumar}, Bull. Inst. Comb. Appl. 58, 48--58 (2010; Zbl 1200.05190)
Lätsch, Martin; Schrader, Rainer Distance-hereditary digraphs. (English) Zbl 1214.05046 J. Discrete Algorithms 8, No. 2, 231-240 (2010). MSC: 05C20 05C12 PDF BibTeX XML Cite \textit{M. Lätsch} and \textit{R. Schrader}, J. Discrete Algorithms 8, No. 2, 231--240 (2010; Zbl 1214.05046) Full Text: DOI
Nebeský, Ladislav Distance-hereditary graphs and signpost systems. (English) Zbl 1188.05061 Discrete Math. 310, No. 3, 527-530 (2010). Reviewer: Van Bang Le (Rostock) MSC: 05C12 PDF BibTeX XML Cite \textit{L. Nebeský}, Discrete Math. 310, No. 3, 527--530 (2010; Zbl 1188.05061) Full Text: DOI
Gurski, Frank; Wanke, Egon On module-composed graphs. (English) Zbl 1273.05184 Paul, Christophe (ed.) et al., Graph-theoretic concepts in computer science. 35th international workshop, WG 2009, Montpellier, France, June 24–26, 2009. Revised papers. Berlin: Springer (ISBN 978-3-642-11408-3/pbk). Lecture Notes in Computer Science 5911, 166-177 (2010). MSC: 05C75 05C85 PDF BibTeX XML Cite \textit{F. Gurski} and \textit{E. Wanke}, Lect. Notes Comput. Sci. 5911, 166--177 (2010; Zbl 1273.05184) 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 PDF BibTeX XML Cite \textit{G. Di Stefano}, Electron. Notes Discrete Math. 35, 227--233 (2009; Zbl 1268.05056) Full Text: DOI
Brandstädt, Andreas; Le, Van Bang; Rautenbach, Dieter A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. (English) Zbl 1221.05040 Discrete Math. 309, No. 12, 3843-3852 (2009). MSC: 05C05 05C12 PDF BibTeX XML Cite \textit{A. Brandstädt} et al., Discrete Math. 309, No. 12, 3843--3852 (2009; Zbl 1221.05040) Full Text: DOI
Brešar, Boštjan; Changat, Manoj; Klavžar, Sandi; Kovše, Matjaž; Mathews, Joseph; Mathews, Antony Cover-incomparability graphs of posets. (English) Zbl 1219.06004 Order 25, No. 4, 335-347 (2008). MSC: 06A07 05C70 05C75 PDF BibTeX XML Cite \textit{B. Brešar} et al., Order 25, No. 4, 335--347 (2008; Zbl 1219.06004) Full Text: DOI
McKee, Terry A. Uniquely Hamiltonian characterizations of distance-hereditary and parity graphs. (English) Zbl 1158.05333 Electron. J. Comb. 15, No. 1, Research Paper N36, 5 p. (2008). MSC: 05C75 05C45 PDF BibTeX XML Cite \textit{T. A. McKee}, Electron. J. Comb. 15, No. 1, Research Paper N36, 5 p. (2008; Zbl 1158.05333) Full Text: EMIS EuDML
Feng, Jinfeng; Guo, Yubao Hamiltonian problem on claw-free and almost distance-hereditary graphs. (English) Zbl 1175.05076 Discrete Math. 308, No. 24, 6558-6563 (2008). MSC: 05C45 05C35 05C12 PDF BibTeX XML Cite \textit{J. Feng} and \textit{Y. Guo}, Discrete Math. 308, No. 24, 6558--6563 (2008; Zbl 1175.05076) 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 PDF BibTeX XML Cite \textit{M. Rao}, Discrete Math. 308, No. 24, 6157--6165 (2008; Zbl 1180.05081) 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 PDF BibTeX XML Cite \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 PDF BibTeX XML Cite \textit{E. Gassner} and \textit{J. Hatzl}, Computing 82, No. 2--3, 171--187 (2008; Zbl 1161.05336) Full Text: DOI
Bandelt, Hans-Jürgen; Chepoi, Victor Metric graph theory and geometry: a survey. (English) Zbl 1169.05015 Goodman, Jacob E. (ed.) et al., Surveys on discrete and computational geometry. Twenty years later. AMS-IMS-SIAM summer research conference, Snowbird, UT, USA, June 18–22, 2006. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4239-3/pbk). Contemporary Mathematics 453, 49-86 (2008). Reviewer: Van Bang Le (Rostock) MSC: 05C12 05-02 PDF BibTeX XML Cite \textit{H.-J. Bandelt} and \textit{V. Chepoi}, Contemp. Math. 453, 49--86 (2008; Zbl 1169.05015)
Feng, Jinfeng; Guo, Yubao Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws. (English) Zbl 1133.05057 Optimization 57, No. 1, 135-141 (2008). MSC: 05C45 05C38 PDF BibTeX XML Cite \textit{J. Feng} and \textit{Y. Guo}, Optimization 57, No. 1, 135--141 (2008; Zbl 1133.05057) 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 PDF BibTeX XML Cite \textit{E. Korach} et al., Discrete Appl. Math. 156, No. 4, 462--477 (2008; Zbl 1138.05062) Full Text: DOI
Ellis-Monaghan, Joanna A.; Sarmiento, Irasema Distance hereditary graphs and the interlace polynomial. (English) Zbl 1129.05051 Comb. Probab. Comput. 16, No. 6, 947-973 (2007). Reviewer: Lorenzo Traldi (Easton) MSC: 05C99 05C12 05C85 PDF BibTeX XML Cite \textit{J. A. Ellis-Monaghan} and \textit{I. Sarmiento}, Comb. Probab. Comput. 16, No. 6, 947--973 (2007; Zbl 1129.05051) Full Text: DOI arXiv
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 PDF BibTeX XML Cite \textit{R.-W. Hung} and \textit{M.-S. Chang}, Discrete Appl. Math. 155, No. 17, 2242--2256 (2007; Zbl 1127.05079) Full Text: DOI
Tedder, Marc; Corneil, Derek An optimal, edges-only fully dynamic algorithm for distance-hereditary graphs. (English) Zbl 1186.68341 Thomas, Wolfgang (ed.) et al., STACS 2007. 24th annual symposium on theoretical aspects of computer science, Aachen, Germany, February 22–24, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-70917-6/pbk). Lecture Notes in Computer Science 4393, 344-355 (2007). MSC: 68R10 05C12 05C85 68Q25 PDF BibTeX XML Cite \textit{M. Tedder} and \textit{D. Corneil}, Lect. Notes Comput. Sci. 4393, 344--355 (2007; Zbl 1186.68341) Full Text: DOI
Rautenbach, Dieter; Brandstaedt, Andreas; Le, Van Bang Distance-hereditary 5-leaf powers. (English) Zbl 1293.05089 Grüttmüller, M. (ed.) et al., ODSA 2006. Conference on optimal discrete structures and algorithms, Rostock, Germany, September 4–6, 2006. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 27, 85-86 (2006). MSC: 05C12 PDF BibTeX XML Cite \textit{D. Rautenbach} et al., Electron. Notes Discrete Math. 27, 85--86 (2006; Zbl 1293.05089) 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 PDF BibTeX XML Cite \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 PDF BibTeX XML Cite \textit{S.-Y. Hsieh} et al., Discrete Appl. Math. 154, No. 3, 508--524 (2006; Zbl 1095.68084) 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 PDF BibTeX XML Cite \textit{O. Cogis} and \textit{E. Thierry}, Discrete Optim. 2, No. 2, 185--188 (2005; Zbl 1135.05312) Full Text: DOI
Oum, Sang-il Rank-width and vertex-minors. (English) Zbl 1070.05023 J. Comb. Theory, Ser. B 95, No. 1, 79-100 (2005). MSC: 05B35 05C83 PDF BibTeX XML Cite \textit{S.-i. Oum}, J. Comb. Theory, Ser. B 95, No. 1, 79--100 (2005; Zbl 1070.05023) 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 PDF BibTeX XML Cite \textit{J. Cáceres} et al., Discrete Math. 297, No. 1--3, 26--37 (2005; Zbl 1070.05035) 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 PDF BibTeX XML Cite \textit{S. Cicerone} and \textit{G. Di Stefano}, J. Discrete Algorithms 2, No. 4, 383--405 (2004; Zbl 1118.68583) Full Text: DOI
Rautenbach, Dieter Graphs with small additive stretch number. (English) Zbl 1062.05053 Discuss. Math., Graph Theory 24, No. 2, 291-301 (2004). Reviewer: Frank Plastria (Brussels) MSC: 05C12 05C75 PDF BibTeX XML Cite \textit{D. Rautenbach}, Discuss. Math., Graph Theory 24, No. 2, 291--301 (2004; Zbl 1062.05053) Full Text: DOI
Hsieh, Sun-Yuan An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs. (English) Zbl 1106.68084 J. Parallel Distrib. Comput. 64, No. 5, 662-685 (2004). MSC: 68R10 05C38 05C85 68P05 68W10 PDF BibTeX XML Cite \textit{S.-Y. Hsieh}, J. Parallel Distrib. Comput. 64, No. 5, 662--685 (2004; Zbl 1106.68084) 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 PDF BibTeX XML Cite \textit{S. Cicerone} and \textit{G. Di Stefano}, J. Discrete Algorithms 1, No. 3--4, 281--302 (2003; Zbl 1074.68042) Full Text: DOI
Kratsch, Dieter; Le, Hoàng-Oanh; Müller, Haiko; Prisner, Erich; Wagner, Dorothea Additive tree spanners. (English) Zbl 1041.05024 SIAM J. Discrete Math. 17, No. 2, 332-340 (2003). MSC: 05C12 05C85 68R10 90B80 PDF BibTeX XML Cite \textit{D. Kratsch} et al., SIAM J. Discrete Math. 17, No. 2, 332--340 (2003; Zbl 1041.05024) 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 PDF BibTeX XML Cite \textit{C. Gavoille} and \textit{C. Paul}, Discrete Math. 273, No. 1--3, 115--130 (2003; Zbl 1029.05136) Full Text: DOI
Chepoi, Victor; Dragan, Feodor Finding a central vertex in an HHD-free graph. (English) Zbl 1022.05080 Discrete Appl. Math. 131, No. 1, 93-111 (2003). MSC: 05C85 05C12 PDF BibTeX XML Cite \textit{V. Chepoi} and \textit{F. Dragan}, Discrete Appl. Math. 131, No. 1, 93--111 (2003; Zbl 1022.05080) Full Text: DOI
McKee, Terry A. Subgraph trees in graph theory. (English) Zbl 1023.05033 Discrete Math. 270, No. 1-3, 3-12 (2003). Reviewer: Péter L.Erdős (Budapest) MSC: 05C05 05C75 05C38 PDF BibTeX XML Cite \textit{T. A. McKee}, Discrete Math. 270, No. 1--3, 3--12 (2003; Zbl 1023.05033) Full Text: DOI
Hsieh, Sun-Yuan; Ho, Chin-Wen; Hsu, Tsan-Sheng; Ko, Ming-Tat; Chen, Gen-Huey Characterization of efficiently parallel solvable problems on distance-hereditary graphs. (English) Zbl 1018.68021 SIAM J. Discrete Math. 15, No. 4, 488-518 (2002). MSC: 68P05 68R10 68W10 68W40 68Q25 PDF BibTeX XML Cite \textit{S.-Y. Hsieh} et al., SIAM J. Discrete Math. 15, No. 4, 488--518 (2002; Zbl 1018.68021) Full Text: DOI
Goddard, Wayne A note on Steiner-distance-hereditary graphs. (English) Zbl 0990.05039 J. Comb. Math. Comb. Comput. 40, 167-170 (2002). Reviewer: Ko-Wei Lih (Nankang) MSC: 05C12 05C05 PDF BibTeX XML Cite \textit{W. Goddard}, J. Comb. Math. Comb. Comput. 40, 167--170 (2002; Zbl 0990.05039)
Aïder, Méziane Almost distance-hereditary graphs. (English) Zbl 0987.05045 Discrete Math. 242, No. 1-3, 1-16 (2002). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C12 05C75 PDF BibTeX XML Cite \textit{M. Aïder}, Discrete Math. 242, No. 1--3, 1--16 (2002; Zbl 0987.05045) Full Text: DOI
Chang, Maw-Shang; Wu, Shaur-Ching; Chang, Gerard J.; Yeh, Hong-Gwa Domination in distance-hereditary graphs. (English) Zbl 0991.05077 Discrete Appl. Math. 116, No. 1-2, 103-113 (2002). Reviewer: Fedor V.Fomin (Paderborn) MSC: 05C69 05C12 PDF BibTeX XML Cite \textit{M.-S. Chang} et al., Discrete Appl. Math. 116, No. 1--2, 103--113 (2002; Zbl 0991.05077) Full Text: DOI
Gavoille, Cyril; Paul, Christophe Split decomposition and distance labelling: an optimal scheme for distance hereditary graphs. (English) Zbl 1182.05046 Nešetřil, Jaroslav (ed.) et al., Comb01—Euroconference on combinatorics, graph theory and applications. Extended abstracts from the conference, Barcelona, Spain, September 12–15, 2001. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 10, 117-120 (2001). MSC: 05C12 05C78 68Q25 PDF BibTeX XML Cite \textit{C. Gavoille} and \textit{C. Paul}, Electron. Notes Discrete Math. 10, 117--120 (2001; Zbl 1182.05046) 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 PDF BibTeX XML Cite \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 PDF BibTeX XML Cite \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
Nicolai, Falk; Szymczak, Thomas Homogeneous sets and domination: A linear time algorithm for distance-hereditary graphs. (English) Zbl 0974.05060 Networks 37, No. 3, 117-128 (2001). MSC: 05C69 05C70 05C85 05C12 PDF BibTeX XML Cite \textit{F. Nicolai} and \textit{T. Szymczak}, Networks 37, No. 3, 117--128 (2001; Zbl 0974.05060) 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 PDF BibTeX XML Cite \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 PDF BibTeX XML Cite \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
McKee, Terry A. Maximal connected cographs in distance-hereditary graphs. (English) Zbl 0953.05024 Util. Math. 57, 73-80 (2000). Reviewer: Lutz Volkmann (Aachen) MSC: 05C12 05C75 PDF BibTeX XML Cite \textit{T. A. McKee}, Util. Math. 57, 73--80 (2000; Zbl 0953.05024)
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 PDF BibTeX XML Cite \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 PDF BibTeX XML Cite \textit{H. J. Broersma} et al., Discrete Appl. Math. 99, No. 1--3, 367--400 (2000; Zbl 0940.05064) Full Text: DOI
Golumbic, Martin Charles; Rotics, Udi On the clique-width of perfect graph classes (extended abstract). (English) Zbl 0941.05047 Widmayer, Peter (ed.) et al., Graph theoretic concepts in computer science. 25th international workshop, WG ’99, Ascona, Switzerland, June 17-19, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1665, 135-147 (1999). MSC: 05C69 05C17 PDF BibTeX XML Cite \textit{M. C. Golumbic} and \textit{U. Rotics}, Lect. Notes Comput. Sci. 1665, 135--147 (1999; Zbl 0941.05047)
Cicerone, Serafino; Di Stefano, Gabriele Graph classes between parity and distance-hereditary graphs. (English) Zbl 0933.05144 Discrete Appl. Math. 95, No. 1-3, 197-216 (1999). Reviewer: H.Müller (Jena) MSC: 05C85 05C60 05C75 05C12 PDF BibTeX XML Cite \textit{S. Cicerone} and \textit{G. Di Stefano}, Discrete Appl. Math. 95, No. 1--3, 197--216 (1999; Zbl 0933.05144) Full Text: DOI
Cicerone, Serafino; Di Stefano, Gabriele On the extension of bipartite to parity graphs. (English) Zbl 0933.05132 Discrete Appl. Math. 95, No. 1-3, 181-195 (1999). Reviewer: G.Gutin (Odense) MSC: 05C75 05C69 05C85 PDF BibTeX XML Cite \textit{S. Cicerone} and \textit{G. Di Stefano}, Discrete Appl. Math. 95, No. 1--3, 181--195 (1999; Zbl 0933.05132) Full Text: DOI
Cicerone, Serafino; Di Stefano, Gabriele Graphs with bounded induced distance. (English) Zbl 0916.05023 Hromkovič, Juraj (ed.) et al., Graph-theoretic concepts in computer science. 24th international workshop, WG ’98, Smolenice Castle, Slovak Republic, June 18–20, 1998. Proceecdings. Berlin: Springer. Lect. Notes Comput. Sci. 1517, 177-191 (1998). MSC: 05C12 05C75 68R10 PDF BibTeX XML Cite \textit{S. Cicerone} and \textit{G. Di Stefano}, Lect. Notes Comput. Sci. 1517, 177--191 (1998; Zbl 0916.05023)
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 PDF BibTeX XML Cite \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
Cicerone, Serafino; Di Stefano, Gabriele Graph classes between parity and distance-hereditary graphs. (English) Zbl 0912.05052 Bridges, D. S. (ed.) et al., Combinatorics, complexity, and logic. Proceedings of the 1st international conference on discrete mathematics and theoretical computer science, DMTCS ’96, Auckland, New Zealand, December 9–13, 1996. Berlin: Springer. 168-181 (1997). MSC: 05C70 05C75 05C60 PDF BibTeX XML Cite \textit{S. Cicerone} and \textit{G. Di Stefano}, in: Combinatorics, complexity, and logic. Proceedings of the 1st international conference on discrete mathematics and theoretical computer science, DMTCS '96, Auckland, New Zealand, December 9--13, 1996. Berlin: Springer. 168--181 (1997; Zbl 0912.05052)
Day, D. P.; Oellermann, Ortrud R.; Swart, Henda C. A characterization of 3-Steiner distance hereditary graphs. (English) Zbl 0888.90140 Networks 30, No. 4, 243-253 (1997). MSC: 90C35 PDF BibTeX XML Cite \textit{D. P. Day} et al., Networks 30, No. 4, 243--253 (1997; Zbl 0888.90140) Full Text: DOI
Bandelt, Hans-Jürgen; Steel, Michael Anthony Symmetric matrices representable by weighted trees over a cancellative abelian monoid. (English) Zbl 0842.05024 SIAM J. Discrete Math. 8, No. 4, 517-525 (1995). MSC: 05C05 20M50 05B20 PDF BibTeX XML Cite \textit{H.-J. Bandelt} and \textit{M. A. Steel}, SIAM J. Discrete Math. 8, No. 4, 517--525 (1995; Zbl 0842.05024) Full Text: DOI