Previous |  Up |  Next

Article

Keywords:
convex set; convexity number; $H$-convex
Summary:

References:
[bh:dg] F. Buckley, F. Harary: Distance in Graphs. Addison-Wesley, Redwood City, 1990. MR 1045632
[chz:geo] G. Chartrand, F. Harary, P. Zhang: On the geodetic number of a graph. (to appear). MR 1871701
[chz:hn] G. Chartrand, F. Harary, P. Zhang: On the hull number of a graph. (to appear). MR 1796634
[cwz:cn] G. Chartrand, C. E. Wall, P. Zhang: The convexity number of a graph. Preprint. MR 1913663
[cz:dgeo] G. Chartrand, P. Zhang: The geodetic number of an oriented graph. Eur. J. Comb. 21 (2000), 181–189. MR 1742433
[cz:fcn] G. Chartrand, P. Zhang: The forcing convexity number of a graph. (to appear). MR 1864046
[cz:fhn] G. Chartrand, P. Zhang: The forcing hull number of a graph. (to appear). MR 1821627
[cz:cs] G. Chartrand, P. Zhang: Convex sets in graphs. (to appear). MR 1744171
[es:hn] M. G. Everett, S. B. Seidman: The hull number of a graph. Discrete Math. 57 (1985), 217–223. MR 0816810
[hn:cg] F. Harary, J. Nieminen: Convexity in graphs. J. Differential Geom. 16 (1981), 185–190. MR 0638785
[mu] H. M. Mulder: The expansion procedure for graphs. Contemporary Methods in Graph Theory, R. Bodendiek (ed.), Wissenschaftsverlag, Mannheim, 1990, pp. 459–477. MR 1126247 | Zbl 0744.05064
[m] H. M. Mulder: The Interval Function of a Graph. Mathematisch Centrum, Amsterdam, 1980. MR 0605838 | Zbl 0446.05039
[n1] L. Nebeský: A characterization of the interval function of a connected graph. Czech. Math. J. 44 (1994), 173–178. MR 1257943
[n2] L. Nebeský: Characterizing of the interval function of a connected graph. Math. Bohem. 123 (1998), 137–144. MR 1673965
Partner of
EuDML logo