메뉴 건너뛰기
Graphs and Combinatorics
Volumn 12, Issue 4, 1996, Pages 345-360
Minimal colorings for properly colored subgraphs
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0000491546     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01858468     Document Type: Article
Times cited : (33)
References (19)
  • 1
    • 0042642383 scopus 로고
    • Alternating hamiltonian circuits in 2-colored complete graphs
    • Akadémiai Kiadó, Budapest
    • Bánkfalvi, M., Bánkfalvi, Z.: Alternating hamiltonian circuits in 2-colored complete graphs, Theory of Graphs, Akadémiai Kiadó, Budapest 11-18 (1968)
    • (1968) Theory of Graphs , pp. 11-18
    • Bánkfalvi, M.1    Bánkfalvi, Z.2
  • 2
    • 85003305705 scopus 로고
    • On the complexity of some hamiltonian and eulerian problems in colored complete graphs
    • Springer-Verlag
    • Benkouar, A., Manoussakis, Y., Paschos, V., Saad, R.: On the complexity of some hamiltonian and eulerian problems in colored complete graphs, LNCS 557 (1991) 190-198 (Springer-Verlag),
    • (1991) LNCS , vol.557 , pp. 190-198
    • Benkouar, A.1    Manoussakis, Y.2    Paschos, V.3    Saad, R.4
  • 4
    • 0039324261 scopus 로고
    • On simple hamiltonian cycles in a 2-colored complete graph
    • Bialostocki, A., Dierker, P.: On simple hamiltonian cycles in a 2-colored complete graph. Ars Combinatoria 32, 13-16 (1991)
    • (1991) Ars Combinatoria , vol.32 , pp. 13-16
    • Bialostocki, A.1    Dierker, P.2
  • 6
    • 0013512178 scopus 로고
    • Graphs with hamiltonian cycles having adjacent lines of different colors
    • Chen, C.C., Daykin, D.E.: Graphs with hamiltonian cycles having adjacent lines of different colors. J. Comb. Theory Ser. B 21, 135-139 (1976)
    • (1976) J. Comb. Theory Ser. B , vol.21 , pp. 135-139
    • Chen, C.C.1    Daykin, D.E.2
  • 8
    • 84960584723 scopus 로고
    • Some Theorems on abstract graphs
    • Dirac, G.A.: Some Theorems on abstract graphs. Proc. London Math. Soc. 2, 69-81 (1952)
    • (1952) Proc. London Math. Soc. , vol.2 , pp. 69-81
    • Dirac, G.A.1
  • 9
  • 11
    • 84966252492 scopus 로고
    • On the structure of linear graphs
    • Erdös, P., Stone, A.H.: On the structure of linear graphs. Bull. Amer. Math. Soc. 52, 1087-1091 (1946)
    • (1946) Bull. Amer. Math. Soc. , vol.52 , pp. 1087-1091
    • Erdös, P.1    Stone, A.H.2
  • 12
    • 0012133603 scopus 로고
    • Rainbow subgraphs in edge-colorings of complete graphs
    • Erdös, P., Tuza, Zs.: Rainbow subgraphs in edge-colorings of complete graphs. Annals of Discr. Math. 55, 81-88 (1993)
    • (1993) Annals of Discr. Math. , vol.55 , pp. 81-88
    • Erdös, P.1    Tuza, Zs.2
  • 13
  • 14
    • 25644451721 scopus 로고
    • Alternating paths in colored complete graphs
    • Manoussakis, Y.: Alternating paths in colored complete graphs. Discr. Appl. Math. 72, 247-260 (1994)
    • (1994) Discr. Appl. Math. , vol.72 , pp. 247-260
    • Manoussakis, Y.1
  • 15
    • 0007059346 scopus 로고
    • Arc coverings of graphs
    • Ore, O.: Arc coverings of graphs. Ann. Mat. Pura Appl. 55, 315-321 (1961)
    • (1961) Ann. Mat. Pura Appl. , vol.55 , pp. 315-321
    • Ore, O.1
  • 17
    • 84990721687 scopus 로고
    • Rainbow subgraphs in properly edge-colored graphs
    • Rödl, V., Tuza, Zs.: Rainbow subgraphs in properly edge-colored graphs. Random Structures and Algorithms 3, 175-182 (1992)
    • (1992) Random Structures and Algorithms , vol.3 , pp. 175-182
    • Rödl, V.1    Tuza, Zs.2
  • 18
    • 0011664838 scopus 로고
    • On a property of the class of n-colorable graphs
    • Seinsche, D.: On a property of the class of n-colorable graphs. J. Comb. Theory Ser. B 16, 191-193 (1974)
    • (1974) J. Comb. Theory Ser. B , vol.16 , pp. 191-193
    • Seinsche, D.1

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