메뉴 건너뛰기




Volumn 77, Issue 1, 1999, Pages 121-137

Weakly Pancyclic Graphs

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0013018538     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.1999.1916     Document Type: Article
Times cited : (21)

References (17)
  • 2
    • 0013464789 scopus 로고
    • Cycles through specified vertices
    • Bollobás B., Brightwell G. Cycles through specified vertices. Combinatorica. 13:1993;147-155.
    • (1993) Combinatorica , vol.13 , pp. 147-155
    • Bollobás, B.1    Brightwell, G.2
  • 3
    • 67349287433 scopus 로고
    • The circumference of a graph with a given minimal degree
    • A. Baker, B. Bollobás, & A. Hajnal. Cambridge: Cambridge Univ. Press
    • Bollobás B., Häggkvist R. The circumference of a graph with a given minimal degree. Baker A., Bollobás B., Hajnal A. A Tribute to Paul Erdos. 1990;99-106 Cambridge Univ. Press, Cambridge.
    • (1990) A Tribute to Paul Erdos , pp. 99-106
    • Bollobás, B.1    Häggkvist, R.2
  • 5
    • 0001775236 scopus 로고
    • Basic graph theory: Paths and circuits
    • R.L. Graham, M. Grötschel, & L. Lovász. Amsterdam: North-Holland
    • Bondy J. A. Basic graph theory: Paths and circuits. Graham R. L., Grötschel M., Lovász L. Handbook of Combinatorics. 1995;3-110 North-Holland, Amsterdam.
    • (1995) Handbook of Combinatorics , pp. 3-110
    • Bondy, J.A.1
  • 6
    • 0012999313 scopus 로고    scopus 로고
    • A sufficient condition for all short cycles
    • Brandt S. A sufficient condition for all short cycles. Discrete Appl. Math. 79:1997;63-66.
    • (1997) Discrete Appl. Math. , vol.79 , pp. 63-66
    • Brandt, S.1
  • 8
    • 0012913125 scopus 로고
    • An extremal problem for cycles in hamiltonian graphs
    • Brandt S., Hendry G. R. T. An extremal problem for cycles in hamiltonian graphs. Graphs Combin. 11:1995;255-262.
    • (1995) Graphs Combin. , vol.11 , pp. 255-262
    • Brandt, S.1    Hendry, G.R.T.2
  • 9
    • 84960584723 scopus 로고
    • Some theorems on abstract graphs
    • Dirac G. A. Some theorems on abstract graphs. Proc. London Math. Soc. (3). 2:1952;69-81.
    • (1952) Proc. London Math. Soc. (3) , vol.2 , pp. 69-81
    • Dirac, G.A.1
  • 10
    • 0039703309 scopus 로고
    • Paths and circuits in graphs: Extreme cases
    • Dirac G. A. Paths and circuits in graphs: Extreme cases. Acta Math. Acad. Sci. Hungar. 10:1959;357-362.
    • (1959) Acta Math. Acad. Sci. Hungar. , vol.10 , pp. 357-362
    • Dirac, G.A.1
  • 11
    • 38249022573 scopus 로고
    • The longest cycles in a graph G with minimum degree at least G/k
    • Egawa Y., Miyamoto T. The longest cycles in a graph G with minimum degree at least G/k. J. Combin. Theory Ser. B. 46:1989;356-362.
    • (1989) J. Combin. Theory Ser. B , vol.46 , pp. 356-362
    • Egawa, Y.1    Miyamoto, T.2
  • 13
    • 0037944903 scopus 로고
    • Edge conditions and cycle structure in bipartite graphs
    • Entringer R. C., Schmeichel E. F. Edge conditions and cycle structure in bipartite graphs. Ars Combin. 26:1988;229-232.
    • (1988) Ars Combin. , vol.26 , pp. 229-232
    • Entringer, R.C.1    Schmeichel, E.F.2
  • 15
    • 51249170131 scopus 로고
    • On hamiltonian bipartite graphs
    • Moon J. W., Moser L. On hamiltonian bipartite graphs. Israel J. Math. 1:1963;163-165.
    • (1963) Israel J. Math. , vol.1 , pp. 163-165
    • Moon, J.W.1    Moser, L.2
  • 16
    • 0039703308 scopus 로고
    • On a graph theorem of Dirac
    • Ore O. On a graph theorem of Dirac. J. Combin. Theory. 2:1967;383-392.
    • (1967) J. Combin. Theory , vol.2 , pp. 383-392
    • Ore, O.1


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