메뉴 건너뛰기




Volumn 306, Issue 15, 2006, Pages 1758-1764

Building blocks for the variety of absolute retracts

Author keywords

Absolute retract; Near unanimity function; Variety

Indexed keywords

BOUNDARY CONDITIONS; FUNCTIONS; INTEGER PROGRAMMING; LINEAR EQUATIONS;

EID: 33745961099     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2006.03.036     Document Type: Article
Times cited : (4)

References (13)
  • 1
    • 38249012090 scopus 로고
    • Graphs with edge-preserving majority functions
    • Bandelt H.J. Graphs with edge-preserving majority functions. Discrete Math. 103 (1992) 1-5
    • (1992) Discrete Math. , vol.103 , pp. 1-5
    • Bandelt, H.J.1
  • 2
    • 33745950731 scopus 로고    scopus 로고
    • R.C. Brewster, T. Feder, P. Hell, J. Huang, G. MacGillivray, Near unanimity functions and varieties of graphs, 2003, submitted for publication.
  • 4
    • 0842283630 scopus 로고    scopus 로고
    • Classification of homomorphisms to oriented cycles, and of k-partite satisfiability
    • Feder T. Classification of homomorphisms to oriented cycles, and of k-partite satisfiability. SIAM J. Discrete Math. 14 (2001) 471-480
    • (2001) SIAM J. Discrete Math. , vol.14 , pp. 471-480
    • Feder, T.1
  • 5
    • 0000473195 scopus 로고    scopus 로고
    • List homomorphisms to reflexive graphs
    • Feder T., and Hell P. List homomorphisms to reflexive graphs. J. Combin. Theory, Ser. B 72 (1998) 236-250
    • (1998) J. Combin. Theory, Ser. B , vol.72 , pp. 236-250
    • Feder, T.1    Hell, P.2
  • 6
    • 0037218674 scopus 로고    scopus 로고
    • Bi-arc graphs and the complexity of list homomorphisms
    • Feder T., Hell P., and Huang J. Bi-arc graphs and the complexity of list homomorphisms. J. Graph Theory 42 (2003) 61-80
    • (2003) J. Graph Theory , vol.42 , pp. 61-80
    • Feder, T.1    Hell, P.2    Huang, J.3
  • 7
    • 0032057865 scopus 로고    scopus 로고
    • The computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory
    • Feder T., and Vardi M.Y. The computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory. SIAM J. Comput. 28 (1998) 57-104
    • (1998) SIAM J. Comput. , vol.28 , pp. 57-104
    • Feder, T.1    Vardi, M.Y.2
  • 8
    • 0002481773 scopus 로고
    • On the complexity of H-colouring
    • Hell P., and Nešetřil J. On the complexity of H-colouring. J. Combin. Theory B 48 (1990) 92-110
    • (1990) J. Combin. Theory B , vol.48 , pp. 92-110
    • Hell, P.1    Nešetřil, J.2
  • 9
    • 0037999301 scopus 로고
    • Absolute retracts and varieties of reflexive graphs
    • Hell P., and Rival I. Absolute retracts and varieties of reflexive graphs. Canad. J. Math. XXXIX (1987) 544-567
    • (1987) Canad. J. Math. , vol.XXXIX , pp. 544-567
    • Hell, P.1    Rival, I.2
  • 10
    • 0013546329 scopus 로고
    • A classification of reflexive graphs: the use of "holes"
    • Jawhari E.M., Pouzet M., and Rival I. A classification of reflexive graphs: the use of "holes". Canad. J. Math. XXXVIII (1986) 1299-1328
    • (1986) Canad. J. Math. , vol.XXXVIII , pp. 1299-1328
    • Jawhari, E.M.1    Pouzet, M.2    Rival, I.3
  • 11
    • 33745964954 scopus 로고    scopus 로고
    • C. Loten, Retractions of chordal and related graphs, Ph.D. Thesis, Simon Fraser University, 2003.
  • 12
    • 0041653466 scopus 로고
    • The smallest graph variety containing all paths
    • Nowakowski R.J., and Rival I. The smallest graph variety containing all paths. Discrete Math. 43 (1983) 223-234
    • (1983) Discrete Math. , vol.43 , pp. 223-234
    • Nowakowski, R.J.1    Rival, I.2
  • 13
    • 33745958879 scopus 로고    scopus 로고
    • A. Quilliot, Homomorphismes, points fixes, rétractions et jeux de poursouite dans les graphes, let ensembles ordonées et les espaces métriques. Thèse d'Etat, Université de Paris VI, 1983.


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