SCOPUS 정보 검색 플랫폼

Journal of Graph Theory

Volumn 26, Issue 1, 1997, Pages 27-34

Degree Sequence Conditions for Maximally Edge-Connected Graphs and Digraphs

(2) Dankelmann, Peter a Volkmann, Lutz b

a UNIVERSITY OF KWAZULU NATAL (South Africa)

b RWTH AACHEN UNIVERSITY (Germany)

Author keywords

Degree sequence; Edge connectivity; Graph

Indexed keywords

EID: 0031518422 PISSN: 03649024 EISSN: None Source Type: Journal
DOI: 10.1002/(SICI)1097-0118(199709)26:1<27::AID-JGT4>3.0.CO;2-J Document Type: Article

Times cited : (28)

References (16)

1
- 0042143499
- On graphs with equal edge-connectivity and mimmum degree
- B. Bollobás, On graphs with equal edge-connectivity and mimmum degree, Discrete Math. 28 (1979), 321-323.
- (1979) Discrete Math. , vol.28 , pp. 321-323
- Bollobás, B.¹

2
- 0000757384
- A graph theoretic approach to a communications problem
- G. Chartrand, A graph theoretic approach to a communications problem. SIAM J. Appl. Math. 14 (1966), 778-781.
- (1966) SIAM J. Appl. Math. , vol.14 , pp. 778-781
- Chartrand, G.¹

3
- 0042644444
- New sufficient conditions for equality of minimum degree and edge-connectivity
- P. Dankelmann and L. Volkmann, New sufficient conditions for equality of minimum degree and edge-connectivity, Ars Combin. 40 (1995), 270-278.
- (1995) Ars Combin. , vol.40 , pp. 270-278
- Dankelmann, P.¹ Volkmann, L.²

4
- 84986522954
- Maximally connected digraphs
- J. Fabrega and M. A. Fiol, Maximally connected digraphs, J. Graph Theory 13 (1989), 657-668.
- (1989) J. Graph Theory , vol.13 , pp. 657-668
- Fabrega, J.¹ Fiol, M.A.²

5
- 0041538102
- Bipartite graphs and digraphs with maximum connectivity
- J. Fabrega and M. A. Fiol, Bipartite graphs and digraphs with maximum connectivity, Discrete Appl. Math. 69 (1996), 271-279.
- (1996) Discrete Appl. Math. , vol.69 , pp. 271-279
- Fabrega, J.¹ Fiol, M.A.²

6
- 59749090356
- The connectivity of large digraphs and graphs
- M. A. Fiol, The connectivity of large digraphs and graphs, J. Graph Theory 17 (1993), 31-45.
- (1993) J. Graph Theory , vol.17 , pp. 31-45
- Fiol, M.A.¹

7
- 84987527874
- A sufficient condition for equality of edge-connectivity and minimum degree of a graph
- D. L. Goldsmith and R. C. Entringer, A sufficient condition for equality of edge-connectivity and minimum degree of a graph, J. Graph Theory. 3 (1979), 251-255.
- (1979) J. Graph Theory. , vol.3 , pp. 251-255
- Goldsmith, D.L.¹ Entringer, R.C.²

8
- 0038899301
- On graphs with equal edge-connectivity and minimum degree
- D. L. Goldsmith and A. T. White, On graphs with equal edge-connectivity and minimum degree. Discrete Math. 23 (1978), 31-36.
- (1978) Discrete Math. , vol.23 , pp. 31-36
- Goldsmith, D.L.¹ White, A.T.²

9
- 0008393057
- Results on the edge-connectivity of graphs
- L. Lesniak, Results on the edge-connectivity of graphs, Discrete Math. 8 (1974), 351-354.
- (1974) Discrete Math. , vol.8 , pp. 351-354
- Lesniak, L.¹

10
- 0037756348
- Critical graphs of given diameter
- J. Plesník, Critical graphs of given diameter, Acta Fac. Rerum Natur. Univ. Commenian Math. 30 (1975), 71-93.
- (1975) Acta Fac. Rerum Natur. Univ. Commenian Math. , vol.30 , pp. 71-93
- Plesník, J.¹

11
- 0040083858
- On equality of edge-connectivity and minimum degree of a graph
- J. Plesník and S. Znám, On equality of edge-connectivity and minimum degree of a graph Arch. Math. (Brno) 25 (1989), 19-25.
- (1989) Arch. Math. (Brno) , vol.25 , pp. 19-25
- Plesník, J.¹ Znám, S.²

12
- 38249037846
- Sufficient conditions for maximally connected dense graphs
- T. Soneoka, H. Nakada, and M. Imase, Sufficient conditions for maximally connected dense graphs, Discrete Math. 63 (1987), 53-66.
- (1987) Discrete Math. , vol.63 , pp. 53-66
- Soneoka, T.¹ Nakada, H.² Imase, M.³

13
- 0040083852
- Bemerkungen zum p-fachen Kantenzusammenhang von Graphen
- L. Volkmann, Bemerkungen zum p-fachen Kantenzusammenhang von Graphen, An. Univ. Buccuresti Mat. 37 (1988), 75-79.
- (1988) An. Univ. Buccuresti Mat. , vol.37 , pp. 75-79
- Volkmann, L.¹

14
- 84986533233
- Edge-connectivity in p-partite graphs
- L. Volkmann, Edge-connectivity in p-partite graphs, J. Graph Theory 13 (1989), 1-6.
- (1989) J. Graph Theory , vol.13 , pp. 1-6
- Volkmann, L.¹

15
- 0042644445
- Springer-Verlag, Wien/New York
- L. Volkmann, Fundamente der Graphentheorie, Springer-Verlag, Wien/New York (1996).
- (1996) Fundamente der Graphentheorie
- Volkmann, L.¹

16
- 0043145382
- A sufficient condition for equality of arc-connectivity and minimum degree of a digraph
- J.-M. Xu, A sufficient condition for equality of arc-connectivity and minimum degree of a digraph, Discrete Math. 133 (1994), 315-318.
- (1994) Discrete Math. , vol.133 , pp. 315-318
- Xu, J.-M.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.