Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 왕문옥 | - |
dc.date.accessioned | 2021-01-19T05:43:15Z | - |
dc.date.available | 2021-01-19T05:43:15Z | - |
dc.date.issued | 2002-05 | - |
dc.identifier.citation | 한국수학사학회지, v. 15, no. 1, page. 147-168 | en_US |
dc.identifier.issn | 1226-931X | - |
dc.identifier.uri | https://scienceon.kisti.re.kr/srch/selectPORSrchArticle.do?cn=JAKO200211921898412 | - |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/157141 | - |
dc.description.abstract | In this paper, we introduce the arrangement of hyperplanes and the graph theory. In particular, we explain how to study the 4-color problem by using characteristic polynomials of the arrangement of hyperplanes. The 4-color problem was appeared in 1852 at first and Appel and Haken proved it by using computer in 1976. The arrangement of hyperplanes induced from a graph is called a graphic arrangement. Graphic arrangement is a subarrangement of Braid arrangement. Thus the chromatic function of a graph is equal to the characteristic polynomial of a graphic arrangement. If we use this result, we can apply the theory of the arrangement of hyperplanes to the study for the chromatic functions. | en_US |
dc.language.iso | ko_KR | en_US |
dc.publisher | 한국수학사학회 | en_US |
dc.title | 초평면 배열 이론과 4색 문제 | en_US |
dc.type | Article | en_US |
dc.relation.journal | 한국수학사학회지 | - |
dc.contributor.googleauthor | 이기석 | - |
dc.contributor.googleauthor | 왕문옥 | - |
dc.contributor.googleauthor | 이준호 | - |
dc.relation.code | 2012210781 | - |
dc.sector.campus | E | - |
dc.sector.daehak | COLLEGE OF SCIENCE AND CONVERGENCE TECHNOLOGY[E] | - |
dc.sector.department | DEPARTMENT OF APPLIED MATHEMATICS | - |
dc.identifier.pid | wang | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.