@article {IOPORT.02192802,
    author       = {Farrugia, Alastair},
    title        = {Orientable convexity, geodetic and hull numbers in graphs.},
    year         = {2005},
    journal      = {Discrete Applied Mathematics},
    volume       = {148},
    number       = {3},
    issn         = {0166-218X},
    pages        = {256-262},
    publisher    = {Elsevier Science B.V. (North-Holland), Amsterdam},
    doi          = {10.1016/j.dam.2005.03.002},
    abstract     = {Summary: We prove three results conjectured or stated by {\it G. Chartrand} and {\it P. Zhan}g [Eur. J. Comb. 21, 181--189 (2000; Zbl 0941.05033)] and {\it G. Chartrand} et al. [Discrete Appl. Math. 116, 115--126 (2002; Zbl 1001.05050); Int. J. Math. Math. Sci. 2003, 2265--2275 (2003; Zbl 1027.05034)]: a connected graph has orientations with different geodetic numbers, orientations with different hull numbers, and, if there are no end-vertices, orientations with different convexity numbers. The proof of the first result is a correction of Chartrand and Zhang's proof, and allows for an easy proof of the second result. The third result says roughly that graphs without end-vertices can be oriented anti-transitively.},
    identifier   = {02192802},
}