论文信息 - On the geodetic iteration number of distance-hereditary graphs - 字舞流文

On the geodetic iteration number of distance-hereditary graphs

Dieter Rautenbach | Mitre Costa Dourado | Fábio Protti | Rodolfo Alves de Oliveira | D. Rautenbach | M. C. Dourado | F. Protti | R. A. Oliveira

[1] Mitre Costa Dourado,et al. The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects , 2015, Eur. J. Comb..

[2] Lhouari Nourine,et al. Polynomial Time Algorithms for Computing a Minimum Hull Set in Distance-Hereditary and Chordal Graphs , 2013, SIAM J. Discret. Math..

[3] Iztok Peterin. The pre-hull number and lexicographic product , 2012, Discret. Math..

[4] Jayme Luiz Szwarcfiter,et al. On the computation of the hull number of a graph , 2009, Discret. Math..

[5] A. Vijayakumar,et al. Studies on convex structures with emphasis on convexity in graphs , 1995 .

[6] Van de M. L. J. Vel. Theory of convex structures , 1993 .

[7] Pierre Duchet,et al. Convex sets in graphs, II. Minimal path convexity , 1987, J. Comb. Theory B.

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

[9] F. Harary. Convexity in Graphs: Achievement and Avoidance Games , 1984 .

[10] Edward Howorka. A characterization of ptolemaic graphs , 1981, J. Graph Theory.

[11] Frank Harary,et al. Convexity in graphs , 1981 .