NL repository
menu
검색
Library
Browse
Communities & Collections
By Date
Authors
Titles
Subject
My Repository
My Account
Receive email updates
Edit Profile
DSpace at EWHA
연구기관
수리과학연구소
Journal papers
View : 818 Download: 0
Dynamic coloring of graphs having no K5 minor
Title
Dynamic coloring of graphs having no K5 minor
Authors
Kim Y.
;
Lee S.J.
;
Oum S.-I.
Ewha Authors
김연진
SCOPUS Author ID
김연진
Issue Date
2016
Journal Title
Discrete Applied Mathematics
ISSN
0166-218X
Citation
Discrete Applied Mathematics
Keywords
Dynamic coloring
;
Four color theorem
;
Hadwiger's conjecture
;
Minor-free graph
Publisher
Elsevier
Indexed
SCIE; SCOPUS
Document Type
Article in Press
Abstract
We prove that every simple connected graph with no K5 minor admits a proper 4-coloring such that the neighborhood of each vertex v having more than one neighbor is not monochromatic, unless the graph is isomorphic to the cycle of length 5. This generalizes the result on planar graphs by S.-J. Kim, W.-J. Park and the second author [Discrete Appl. Math. 161 (2013) 2207-2212]. © 2016 Elsevier B.V.
DOI
10.1016/j.dam.2016.01.022
Appears in Collections:
연구기관
>
수리과학연구소
>
Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML
Show full item record
Find@EWHA
트윗하기
BROWSE
Communities & Collections
By Date
Authors
Titles
Subject