Brigham, Robert C.; Chartrand, Gary; Dutton, Ronald D.; Zhang, Ping On induced subdigraphs of certain distance-defined digraphs. (English) Zbl 1102.05029 Util. Math. 68, 239-253 (2005). Reviewer: Linda Lesniak (Madison) MSC: 05C20 PDFBibTeX XMLCite \textit{R. C. Brigham} et al., Util. Math. 68, 239--253 (2005; Zbl 1102.05029)
Chartrand, Gary; Muntean, Raluca; Saenpholphat, Varaporn; Zhang, Ping Which graphs are divisor graphs? (English) Zbl 0997.05088 Congr. Numerantium 151, 189-200 (2001). MSC: 05C78 05C20 05C12 05C75 PDFBibTeX XMLCite \textit{G. Chartrand} et al., Congr. Numerantium 151, 189--200 (2001; Zbl 0997.05088)
Chartrand, Gary; Harary, Frank; Yue, Bill Quan On the out-domination and in-domination numbers of a digraph. (English) Zbl 0978.05057 Discrete Math. 197-198, 179-183 (1999). MSC: 05C69 05C20 PDFBibTeX XMLCite \textit{G. Chartrand} et al., Discrete Math. 197--198, 179--183 (1999; Zbl 0978.05057) Full Text: DOI
Chartrand, G.; Gavlas, H.; Schulz, K.; Winters, S. J. On strong digraphs with a prescribed ultracenter. (English) Zbl 0897.05033 Czech. Math. J. 47, No. 1, 83-94 (1997). Reviewer: B.Zelinka (Liberec) MSC: 05C12 05C20 PDFBibTeX XMLCite \textit{G. Chartrand} et al., Czech. Math. J. 47, No. 1, 83--94 (1997; Zbl 0897.05033) Full Text: DOI EuDML
Chartrand, G.; Tian, S. Distance in digraphs. (English) Zbl 0903.05018 Comput. Math. Appl. 34, No. 11, 15-23 (1997). Reviewer: F.Gliviak (Bratislava) MSC: 05C12 05C20 PDFBibTeX XMLCite \textit{G. Chartrand} and \textit{S. Tian}, Comput. Math. Appl. 34, No. 11, 15--23 (1997; Zbl 0903.05018) Full Text: DOI
Boals, Alfred J.; Chartrand, Gary; Nouh, Jamal; VanderJagt, Donald W.; Yates, Julie Path vectors and optimal trees. (English) Zbl 0918.05072 Congr. Numerantium 124, 145-159 (1997). Reviewer: Jörgen Bang-Jensen (Odense) MSC: 05C38 05C35 05C20 05C05 PDFBibTeX XMLCite \textit{A. J. Boals} et al., Congr. Numerantium 124, 145--159 (1997; Zbl 0918.05072)
Chartrand, Gary; Mynhardt, Christina M.; Saba, Farrokh On least common multiples of digraphs. (English) Zbl 0853.05060 Util. Math. 49, 45-63 (1996). Reviewer: J.W.Moon (Edmonton) MSC: 05C70 05C20 PDFBibTeX XMLCite \textit{G. Chartrand} et al., Util. Math. 49, 45--63 (1996; Zbl 0853.05060)
Chartrand, Gary; VanderJagt, Donald W.; Yue, Bill Quan Orientable domination in graphs. (English) Zbl 0899.05028 Congr. Numerantium 119, 51-63 (1996). MSC: 05C35 PDFBibTeX XMLCite \textit{G. Chartrand} et al., Congr. Numerantium 119, 51--63 (1996; Zbl 0899.05028)
Chartrand, Gary; Harary, Frank; Schultz, Michelle; VanderJagt, Donald W. Achievement and avoidance of a strong orientation of a graph. (English) Zbl 0904.05033 Congr. Numerantium 108, 193-203 (1995). MSC: 05C20 91A43 PDFBibTeX XMLCite \textit{G. Chartrand} et al., Congr. Numerantium 108, 193--203 (1995; Zbl 0904.05033)
Chartrand, Gary; Harary, Frank; Schultz, Michelle; Wall, Curtiss E. Forced orientation numbers of a graph. (English) Zbl 0836.05043 Congr. Numerantium 100, 183-191 (1994). MSC: 05C35 PDFBibTeX XMLCite \textit{G. Chartrand} et al., Congr. Numerantium 100, 183--191 (1994; Zbl 0836.05043)
Chartrand, Gary; Tian, Songlin Maximum distance in digraphs. (English) Zbl 0763.05037 Graph theory, combinatorics, algorithms, and applications, Proc. 2nd Int. Conf., San Francisco/CA (USA) 1989, 525-538 (1991). MSC: 05C12 05C20 05C75 PDFBibTeX XMLCite \textit{G. Chartrand} and \textit{S. Tian}, in: Existence theorems for nonseparable \(\alpha\)-valuations of snakes. . 525--538 (1991; Zbl 0763.05037)