A Polynomial Algorithm for Testing Whether a Graph is 3-Steiner Distance Hereditary

Abstract Let G be a connected graph and S ⊆ V(G). Then the Steiner distance of S in G, denoted by dG(S), is the smallest number of edges in a connected subgraph of G that contains S. A connected graph is k-Steiner distance hereditary, k ⩾ 2, if for every S ⊆ V(G) such that ¦ S ¦ = k and every connected induced subgraph H of G containing S, dH(S) = dG(S). A polynomial algorithm for testing whether a graph is 3-Steiner distance hereditary is developed. In addition, a polynomial algorithm for testing whether an arbitrary graph has a cycle of length exceeding t, for any fixed t, without crossing chords is provided.

[1]  Jeremy P. Spinrad.  Finding Large Holes , 1991, Inf. Process. Lett..

[2]  Liping Sun.  Two classes of perfect graphs , 1991, J. Comb. Theory, Ser. B.

[3]  Mehdi Behzad,et al.  Graphs and Digraphs , 1981, The Mathematical Gazette.

[4]  Ortrud R. Oellermann,et al.  Steiner Distance-Hereditary Graphs , 1994, SIAM J. Discret. Math..

[5]  Hans-Jürgen Bandelt,et al.  Distance-hereditary graphs , 1986, J. Comb. Theory B.

[6]  Frank Harary,et al.  Graph Theory , 2016 .

[7]  Peter L. Hammer,et al.  Completely separable graphs , 1990, Discret. Appl. Math..

[8]  E. Howorka.  A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS , 1977 .

[9]  Marina Moscarini,et al.  Distance-Hereditary Graphs, Steiner Trees, and Connected Domination , 1988, SIAM J. Comput..