Geodesic
On minimum locally $n$-(arc)-strong digraphs
Czechoslovak Mathematical Journal, Tome 46 (1996) no. 2, pp. 317-323
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1996.127293
Classification : 05C20, 05C40 
@article{10_21136_CMJ_1996_127293,
     author = {Chen, Zhibo},
     title = {On minimum locally $n$-(arc)-strong digraphs},
     journal = {Czechoslovak Mathematical Journal},
     pages = {317--323},
     year = {1996},
     volume = {46},
     number = {2},
     doi = {10.21136/CMJ.1996.127293},
     mrnumber = {1388619},
     zbl = {0870.05028},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1996.127293/}
}
TY  - JOUR
AU  - Chen, Zhibo
TI  - On minimum locally $n$-(arc)-strong digraphs
JO  - Czechoslovak Mathematical Journal
PY  - 1996
SP  - 317
EP  - 323
VL  - 46
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1996.127293/
DO  - 10.21136/CMJ.1996.127293
LA  - en
ID  - 10_21136_CMJ_1996_127293
ER  - 
%0 Journal Article
%A Chen, Zhibo
%T On minimum locally $n$-(arc)-strong digraphs
%J Czechoslovak Mathematical Journal
%D 1996
%P 317-323
%V 46
%N 2
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1996.127293/
%R 10.21136/CMJ.1996.127293
%G en
%F 10_21136_CMJ_1996_127293
Chen, Zhibo. On minimum locally $n$-(arc)-strong digraphs. Czechoslovak Mathematical Journal, Tome 46 (1996) no. 2, pp. 317-323. doi: 10.21136/CMJ.1996.127293

[1] J.N. Ayoub and I.T. Frish: On the smallest-branch cuts in directed graphs. IEEE Trans. Circuit Theory CT–17 (1970), 249–250. | DOI | MR

[2] J.C. Bermond, N. Homobono and C. Peyrat: Large fault-tolerant interconnection networks. Graphs and Combinatorics 5 (1989), 107–123. | DOI | MR

[3] G. Chartrand and L. Lesniak: Graphs and Digraphs. Second edition, Wadsworth, 1986. | MR

[4] G. Chartrand and R.E. Pippert: Locally connected graphs. Časopis Pěst. Mat. 99 (1974), 158–163. | MR

[5] Zhibo Chen: On locally $n\text{-(arc)}$-strong digraphs. (to appear). | MR

[6] Zhibo Chen: Local connectedness of digraphs. Graph Theory, Combinatorics, and Applications: Proceedings of the Seventh Quadrennial International Conference on the Theory and Applications of Graphs, Vol. 1, Y. Alavi and A. Schwenk (eds.), John Willey & Sons, New York, 1995, pp. 195–200. | MR

[7] Y.O. Hamidoune: On the connectivity of Cayley digraphs. Europ. J. Combinatorics 5 (1984), 309–312. | DOI | MR | Zbl

[8] W. Mader: Connectivity and edge-connectivity in finite graphs. Surveys in Combinatorics: Proc. Seventh British Combinatorial Conference, Cambridge 1979, London, Math. Soc. Lec. Note Ser. 38, 1979, pp. 66–95. | MR | Zbl

[9] L. Nebeský: Every connected, locally connected graph in upper embeddable. J. Graph Theory 5 (1981), 205–207. | DOI | MR

[10] L. Nebeský: On locally quasiconnected graphs and their upper embeddability. Czechoslovak Math. J. 35 (1985), no. 110, 162–166. | MR

[11] L. Nebeský: $N_2$-locally connected graphs and their upper embeddability. Czechoslovak Math. J. 41 (1991), no. 116, 731–735. | MR

[12] Z. Ryjáček: On graphs with isomorphic, non-isomorphic and connected $N_2$-neighborhoods. Časopis Pěst. Mat. 112 (1987), 66–79.

[13] J. Sedláček: Local properties of graphs. Časopis Pěst. Mat. 106 (1981), 290–298. (Czech) | MR

[14] D.W. Vanderjagt: Sufficient conditions for locally connected graphs. Časopis Pěst. Mat. 99 (1974), 400–404. | MR | Zbl

Cité par Sources :