메뉴 건너뛰기




Volumn 98, Issue 2, 2008, Pages 400-414

Algebraic characterization of uniquely vertex colorable graphs

Author keywords

Colorability algorithm; Gr bner basis; Uniquely colorable graph; Vertex coloring

Indexed keywords


EID: 38949149984     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2007.08.004     Document Type: Article
Times cited : (35)

References (12)
  • 3
    • 0000576339 scopus 로고
    • Colorings and orientations of graphs
    • Alon N., and Tarsi M. Colorings and orientations of graphs. Combinatorica 12 (1992) 125-134
    • (1992) Combinatorica , vol.12 , pp. 125-134
    • Alon, N.1    Tarsi, M.2
  • 4
    • 38949104868 scopus 로고    scopus 로고
    • D. Bayer, The division algorithm and the Hilbert scheme, PhD thesis, Harvard University, 1982
    • D. Bayer, The division algorithm and the Hilbert scheme, PhD thesis, Harvard University, 1982
  • 5
    • 38249002114 scopus 로고
    • On uniquely 3-colorable graphs
    • Chao C.-Y., and Chen Z. On uniquely 3-colorable graphs. Discrete Math. 112 (1993) 21-27
    • (1993) Discrete Math. , vol.112 , pp. 21-27
    • Chao, C.-Y.1    Chen, Z.2
  • 8
    • 0242289911 scopus 로고    scopus 로고
    • On small uniquely vertex-colourable graphs and Xu's conjecture
    • Daneshgar A., and Naserasr R. On small uniquely vertex-colourable graphs and Xu's conjecture. Discrete Math. 223 (2000) 93-108
    • (2000) Discrete Math. , vol.223 , pp. 93-108
    • Daneshgar, A.1    Naserasr, R.2
  • 9
    • 1342273357 scopus 로고
    • Gröbner bases and graph colorings
    • de Loera J.A. Gröbner bases and graph colorings. Beiträge Algebra Geom. 36 (1995) 89-96
    • (1995) Beiträge Algebra Geom. , vol.36 , pp. 89-96
    • de Loera, J.A.1
  • 10
    • 38149146720 scopus 로고
    • Stable sets and polynomials
    • Lovász L. Stable sets and polynomials. Discrete Math. 124 (1994) 137-153
    • (1994) Discrete Math. , vol.124 , pp. 137-153
    • Lovász, L.1
  • 11
    • 38949171773 scopus 로고    scopus 로고
    • M. Mnuk, On an algebraic description of colorability of planar graphs, in: Koji Nakagawa (Ed.), Logic, Mathematics and Computer Science: Interactions, Proceedings of the Symposium in Honor of Bruno Buchberger's 60th Birthday, RISC, Linz, Austria, October 20-22, 2002, pp. 177-186
    • M. Mnuk, On an algebraic description of colorability of planar graphs, in: Koji Nakagawa (Ed.), Logic, Mathematics and Computer Science: Interactions, Proceedings of the Symposium in Honor of Bruno Buchberger's 60th Birthday, RISC, Linz, Austria, October 20-22, 2002, pp. 177-186
  • 12
    • 38249017054 scopus 로고
    • The size of uniquely colorable graphs
    • Xu S. The size of uniquely colorable graphs. J. Combin. Theory Ser. B 50 (1990) 319-320
    • (1990) J. Combin. Theory Ser. B , vol.50 , pp. 319-320
    • Xu, S.1


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