컨텐츠 시작
학술대회/행사
초록검색
| 제출번호(No.) | 0262 |
|---|---|
| 분류(Section) | Contributed Talk |
| 분과(Session) | (DM) Discrete Mathematics (DM) |
| 발표시간(Time) | 20th-C-10:20 -- 10:40 |
| 영문제목 (Title(Eng.)) |
Relaxations of square coloring |
| 저자(Author(s)) |
Hyemin Kwon1, Boram Park1 Ajou University1 |
| 초록본문(Abstract) | A square coloring of a graph $G$ is a proper coloring of $G^2$, where $G^2$ is the graph obtained from $G$ by adding edges joining vertices at distance at most $2$ in $G$. A square coloring of a graph is a interesting topic of research not only in graph theory but also in computer science. Recently, various colorings were introduced that relaxing the conditions of square coloring such as odd coloring, proper conflict-free coloring, and strong odd coloring. In this talk, we introduce the definitions of several relaxations and its recent results. |
| 분류기호 (MSC number(s)) |
05C15 |
| 키워드(Keyword(s)) | Odd coloring, proper conflict-free coloring, strong odd coloring |
| 강연 형태 (Language of Session (Talk)) |
English |