Previous |  Up |  Next

Article

Title: Digraphs maximal with respect to arc connectivity (English)
Author: Horák, Peter
Language: English
Journal: Mathematica Slovaca
ISSN: 0139-9918
Volume: 32
Issue: 3
Year: 1982
Pages: 243-253
.
Category: math
.
MSC: 05C20
MSC: 05C40
idZBL: Zbl 0489.05035
idMR: MR670000
.
Date available: 2009-09-25T09:21:35Z
Last updated: 2012-07-31
Stable URL: http://hdl.handle.net/10338.dmlcz/130620
.
Reference: [1] GELLER D., HARARY F.: Connectivity in digraphs.In: Recent Trends in Graph Theory (Lecture Notes in Mathematics 186), Springer-Verlag, Berlin 1971, 105-115. Zbl 0214.23401, MR 0278998
Reference: [2] HARARY F.: The number of dissimilar supergraphs of a lineaг graph.Pacific J. Math., 7, 1957, 903-911. MR 0087623
Reference: [3] HARARY F.: On the numbeг of bicolored graphs.Pacific J. Math., 8, 1958, 743-755. MR 0103834
Reference: [4] HARARY, F: Graph Theoгy.Addison-Wesley, Reading, Mass., 1969. MR 0256911
Reference: [5] HORÁK P.: Digraphs maximal with respect to connectivity.Math. Slovaca, 29, 1979, 87-90. Zbl 0401.05047, MR 0561782
Reference: [6] KAMEDA T.: Note on Halin's theorem on minimally connected gгaphs.J. Combinatorial Theory Seг. B, 17, 1974, 1-4. MR 0416966
Reference: [7] MADER W.: Ecken von Innen- und Aussengгad n in minimal n-fach kantenzusammenhangenden Digraphen.Arch. Math. (Basel), 25, 1974, 107-112. MR 0340087
Reference: [8] PÓLYA G.: Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen.Acta Math., 68, 1937, 145-254. Zbl 0017.23202
.

Files

Files Size Format View
MathSlov_32-1982-3_4.pdf 577.8Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo