메뉴 건너뛰기
Graphs and Combinatorics
Volumn 18, Issue 1, 2002, Pages 133-146
Upper bounds to the number of vertices in a k-critically n-connected graph
Author keywords

Connectivity; Hyperedge domination; Matching number; Transversal number
Indexed keywords

EID: 0036972952     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003730200008     Document Type: Article
Times cited : (4)
References (20)
  • 1
    • 0003106496 scopus 로고
    • Transversal numbers of uniform hypergraphs
    • Alon, N.: Transversal numbers of uniform hypergraphs. Graphs Comb. 6, 1-4 (1990)
    • (1990) Graphs Comb. , vol.6 , pp. 1-4
    • Alon, N.1
  • 2
    • 0013015338 scopus 로고
    • Graphes et hypergraphes
    • Dunod
    • Berge, C.: Graphes et hypergraphes. Monog. Univ. Math. 37, Dunod (1970)
    • (1970) Monog. Univ. Math. , vol.37
    • Berge, C.1
  • 5
    • 0012914808 scopus 로고
    • On multiply critically h-connected graphs
    • Hamidoune, Y.O.: On multiply critically h-connected graphs. J. Comb. Theory, Ser. B 30, 108-112 (1981)
    • (1981) J. Comb. Theory, Ser. B , vol.30 , pp. 108-112
    • Hamidoune, Y.O.1
  • 6
    • 0013019861 scopus 로고    scopus 로고
    • On the existence of (k, l)-critical graphs
    • Jordán, T.: On the existence of (k, l)-critical graphs. Discrete Math. 179, 1-3, 273-275 (1998)
    • (1998) Discrete Math. , vol.179 , Issue.1-3 , pp. 273-275
    • Jordán, T.1
  • 7
    • 0013019862 scopus 로고    scopus 로고
    • The k-critically 2k-connected graphs for k ∈ {3, 4}
    • Kriesell, M.: The k-critically 2k-connected graphs for k ∈ {3, 4}. J. Comb. Theory, Ser. B 78, 69-80 (2000)
    • (2000) J. Comb. Theory, Ser. B , vol.78 , pp. 69-80
    • Kriesell, M.1
  • 8
    • 23044525484 scopus 로고    scopus 로고
    • The symmetric (2k, k)-graphs
    • Kriesell, M.: The symmetric (2k, k)-graphs. J. Graph Theory, 36, 35-51 (2001)
    • (2001) J. Graph Theory , vol.36 , pp. 35-51
    • Kriesell, M.1
  • 9
    • 38249016861 scopus 로고
    • An upper bound for the transversal numbers of 4-uniform hypergraphs
    • Lai, F.-C., Chang, G.J.: An upper bound for the transversal numbers of 4-uniform hypergraphs. J. Comb. Theory, Ser. B 50, 129-133 (1990)
    • (1990) J. Comb. Theory, Ser. B , vol.50 , pp. 129-133
    • Lai, F.-C.1    Chang, G.J.2
  • 10
    • 0012966790 scopus 로고
    • Eine eigenschaft der atome endlicher graphen
    • Mader, W.: Eine Eigenschaft der Atome endlicher Graphen. Arch. Math. 22, 333-336 (1971)
    • (1971) Arch. Math. , vol.22 , pp. 333-336
    • Mader, W.1
  • 11
    • 0000576654 scopus 로고
    • Ecken vom Grad n in minimalen n-fach zusammenhängenden graphen
    • Mader, W.: Ecken vom Grad n in minimalen n-fach zusammenhängenden Graphen. Arch. Math. 23, 219-224 (1972)
    • (1972) Arch. Math. , vol.23 , pp. 219-224
    • Mader, W.1
  • 12
    • 0001011005 scopus 로고
    • Endlichkeitssätze für k-kritische graphen
    • Mader, W.: Endlichkeitssätze für k-kritische Graphen. Math. Ann. 229, 143-153 (1977)
    • (1977) Math. Ann. , vol.229 , pp. 143-153
    • Mader, W.1
  • 13
    • 0002045578 scopus 로고
    • On k-critically n-connected graphs
    • New York: Academic Press
    • Mader, W.: On k-critically n-connected graphs. Progress in graph theory, pp. 389-398, New York: Academic Press 1984
    • (1984) Progress in Graph Theory , pp. 389-398
    • Mader, W.1
  • 14
    • 85012649862 scopus 로고
    • Disjunkte fragmente in kritisch n-fach zusammenhängenden Graphen
    • Mader, W.: Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen. Eur. J. Comb. 6, 353-359 (1985)
    • (1985) Eur. J. Comb. , vol.6 , pp. 353-359
    • Mader, W.1
  • 15
    • 38249029615 scopus 로고
    • Generalizations of critical connectivity of graphs
    • Mader, W.: Generalizations of critical connectivity of graphs. Discrete Math. 72, 267-283 (1988)
    • (1988) Discrete Math. , vol.72 , pp. 267-283
    • Mader, W.1
  • 16
    • 0013003732 scopus 로고
    • On k-critical, n-connected graphs
    • Maurer, St.B., Slater, P.J.: On k-critical, n-connected graphs. Discrete Math. 20, 255-262 (1988)
    • (1988) Discrete Math. , vol.20 , pp. 255-262
    • Maurer, St.B.1    Slater, P.J.2
  • 17
    • 0040941114 scopus 로고
    • On locally A-critically n-connected graphs
    • Su, J.: On locally A-critically n-connected graphs. Discrete Math. 120, 183-190 (1993)
    • (1993) Discrete Math. , vol.120 , pp. 183-190
    • Su, J.1
  • 18
    • 0012956953 scopus 로고
    • Fragments in 2-critically n-connected graphs
    • Su, J.: Fragments in 2-critically n-connected graphs. J. Comb. Theory, Ser. B 58, 269-279 (1993)
    • (1993) J. Comb. Theory, Ser. B , vol.58 , pp. 269-279
    • Su, J.1
  • 19
    • 84987490500 scopus 로고
    • Fragments in k-critical n-connected graphs
    • Su, J.: Fragments in k-critical n-connected graphs. J. Graph Theory 20, 287-295 (1995)
    • (1995) J. Graph Theory , vol.20 , pp. 287-295
    • Su, J.1
  • 20
    • 0002628574 scopus 로고
    • Covering all cliques of a graph
    • Tuza, Zs.: Covering all cliques of a graph. Discrete Math. 86, 117-126 (1990)
    • (1990) Discrete Math. , vol.86 , pp. 117-126
    • Tuza, Zs.1

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