메뉴 건너뛰기
SIAM Journal on Discrete Mathematics
Volumn 15, Issue 3, 2002, Pages 283-288
Finding 1-factors in bipartite regular graphs and edge-coloring bipartite graphs
Author keywords

Edge coloring; Perfect matching; Regular bipartite graphs; Time tabling
Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FUNCTIONS; PROBLEM SOLVING; RANDOM PROCESSES;
EID: 0242374981     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480199351136     Document Type: Article
Times cited : (6)
References (7)
  • 1
    • 0000175577 scopus 로고
    • On edge coloring bipartite graphs
    • R. COLE AND J HOPCROFT, On edge coloring bipartite graphs, SIAM J. Comput., 11 (1982), pp. 540-546.
    • (1982) SIAM J. Comput. , vol.11 , pp. 540-546
    • Cole, R.1    Hopcroft, J.2
  • 2
    • 0001575222 scopus 로고
    • Using Euler partitions to edge color bipartite multigraphs
    • H.N. GABOW, Using Euler partitions to edge color bipartite multigraphs, Internat. J. Comput. Information Sci., 5 (1976), pp. 345-355.
    • (1976) Internat. J. Comput. Information Sci. , vol.5 , pp. 345-355
    • Gabow, H.N.1
  • 3
    • 0001118054 scopus 로고
    • Algorithms for edge coloring bipartite graphs and multigraphs
    • H.N. GABOW AND O KARIV, Algorithms for edge coloring bipartite graphs and multigraphs, SIAM J. Comput , 11 (1982), pp 117-129.
    • (1982) SIAM J. Comput , vol.11 , pp. 117-129
    • Gabow, H.N.1    Kariv, O.2
  • 4
    • 0010618580 scopus 로고    scopus 로고
    • Edge-coloring bipartite graphs
    • A. KAPOOR AND R. RIZZI, Edge-coloring bipartite graphs, J. Algorithms, 34 (2000), pp. 390-396.
    • (2000) J. Algorithms , vol.34 , pp. 390-396
    • Kapoor, A.1    Rizzi, R.2
  • 5
    • 0000128914 scopus 로고
    • Graphok és alkalmazásuk a determinánsok és a halmazok elméletére
    • in Hungarian
    • D. KÖNIG, Graphok és alkalmazásuk a determinánsok és a halmazok elméletére, Mathematikai és Természettudományi Értesito, 34 (1916), pp. 104-119 (in Hungarian).
    • (1916) Mathematikai és Természettudományi Értesito , vol.34 , pp. 104-119
    • König, D.1
  • 6
    • 22044436859 scopus 로고    scopus 로고
    • Ko″nig's edge coloring theorem without augmenting paths
    • R. RIZZI, Ko″nig's edge coloring theorem without augmenting paths, J. Graph Theory, 29 (1998), p. 87.
    • (1998) J. Graph Theory , vol.29 , pp. 87
    • Rizzi, R.1
  • 7
    • 0032266933 scopus 로고    scopus 로고
    • Bipartite edge coloring in O(Δm) time
    • A. SCHRIJVER, Bipartite edge coloring in O(Δm) time, SIAM J. Comput., 28 (1998), pp. 841-846.
    • (1998) SIAM J. Comput. , vol.28 , pp. 841-846
    • Schrijver, A.1

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