Previous |  Up |  Next

Article

Title: Steiner distance in graphs (English)
Title: Steinerova vzdálenost v grafech (Czech)
Author: Chartrand, Gary
Author: Oellermann, Ortrud R.
Author: Tian, Song Lin
Author: Zou, Hung Bin
Language: English
Journal: Časopis pro pěstování matematiky
ISSN: 0528-2195
Volume: 114
Issue: 4
Year: 1989
Pages: 399-410
Summary lang: English
Summary lang: Czech
Summary lang: Russian
.
Category: math
.
MSC: 05C35
idZBL: Zbl 0688.05040
idMR: MR1027236
.
Date available: 2009-09-23T09:55:02Z
Last updated: 2012-05-12
Stable URL: http://hdl.handle.net/10338.dmlcz/118395
.
Reference: [1] G. Chartrand L. Lesniak: Graphs & Digraphs.2nd Edition. Monterey, CA (1986). MR 0834583
Reference: [2] F. Harary: The maximum connectivity of a graph.Proc. Acad. Sci. USA 48 (1962) 1142- 1146. Zbl 0115.41003, MR 0137663
Reference: [3] R. M. Karp: Reducibility among combinatorial problems.Complexity of Computer Computations (eds., R. E. Miller and J. W. Thatcher). Plenum Press, New York (1972) 85-103. MR 0378476
Reference: [4] O. R. Oellermann S. Tian: Steiner centers in graphs.J. Graph Theory (to appear). MR 1073100
.

Files

Files Size Format View
CasPestMat_114-1989-4_8.pdf 955.9Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo