메뉴 건너뛰기




Volumn 31, Issue 2, 1999, Pages 101-106

On 2-factors of a bipartite graph

Author keywords

Bipartite graphs; Cycles; Factors

Indexed keywords


EID: 0040573170     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199906)31:2<101::AID-JGT3>3.0.CO;2-5     Document Type: Article
Times cited : (21)

References (13)
  • 1
    • 84963042075 scopus 로고
    • Embedding arbitrary graphs of maximum degree two
    • M. Aigner and S. Brandt, Embedding arbitrary graphs of maximum degree two, J London Math Soc 48 (1993), 39-51.
    • (1993) J London Math Soc , vol.48 , pp. 39-51
    • Aigner, M.1    Brandt, S.2
  • 2
    • 38249042305 scopus 로고
    • Partition of a bipartite Hamiltonian graph into two cycles
    • D. Amar, Partition of a bipartite Hamiltonian graph into two cycles, Discrete Math 58 (1986), 1-10.
    • (1986) Discrete Math , vol.58 , pp. 1-10
    • Amar, D.1
  • 3
    • 0041165325 scopus 로고
    • Covering the vertices of a digraph by cycles of prescribed length
    • D. Amar and A. Raspaud, Covering the vertices of a digraph by cycles of prescribed length, Discrete Math 87 (1991), 111-118.
    • (1991) Discrete Math , vol.87 , pp. 111-118
    • Amar, D.1    Raspaud, A.2
  • 4
    • 0004602289 scopus 로고
    • A method in graph theory
    • J. A. Bondy and V. Chvátal, A method in graph theory, Discrete Math 15 (1976), 111-135.
    • (1976) Discrete Math , vol.15 , pp. 111-135
    • Bondy, J.A.1    Chvátal, V.2
  • 8
    • 0348125929 scopus 로고
    • On the maximal number of independent circuits in a graph
    • K. Corrádi and A. Hajnal, On the maximal number of independent circuits in a graph, Acta Math Acad Sci Hungar 14 (1963), 423-439.
    • (1963) Acta Math Acad Sci Hungar , vol.14 , pp. 423-439
    • Corrádi, K.1    Hajnal, A.2
  • 9
    • 0000755935 scopus 로고
    • On circuits in graphs
    • M. El-Zahar, On circuits in graphs, Discrete Math 50 (1984), 227-230.
    • (1984) Discrete Math , vol.50 , pp. 227-230
    • El-Zahar, M.1
  • 10
    • 0039978290 scopus 로고
    • Vertex-disjoint cycles in a directed graph
    • C. Little and H. Wang, Vertex-disjoint cycles in a directed graph, Austr J Combin 12 (1995), 113-119.
    • (1995) Austr J Combin , vol.12 , pp. 113-119
    • Little, C.1    Wang, H.2
  • 11
    • 38248999498 scopus 로고
    • Partition of a bipartite graph into cycles
    • H. Wang, Partition of a bipartite graph into cycles, Discrete Math 117 (1993), 287-291.
    • (1993) Discrete Math , vol.117 , pp. 287-291
    • Wang, H.1
  • 12
    • 0040571106 scopus 로고    scopus 로고
    • Partition of a directed bipartite graph into two directed cycles
    • H. Wang, C. Little, and K. Teo, Partition of a directed bipartite graph into two directed cycles, Discrete Math 160 (1996), 283-289.
    • (1996) Discrete Math , vol.160 , pp. 283-289
    • Wang, H.1    Little, C.2    Teo, K.3
  • 13
    • 0030140906 scopus 로고    scopus 로고
    • On the maximum number of independent cycles in a bipartite graph
    • H. Wang, On the maximum number of independent cycles in a bipartite graph, J Combin Theory B 67 (1996), 152-164.
    • (1996) J Combin Theory B , vol.67 , pp. 152-164
    • Wang, H.1


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