DSpace at EWHA: Dynamic coloring of graphs having no K5 minor

View : 806 Download: 0

Full metadata record

DC Field	Value	Language
dc.contributor.author	김연진	-
dc.date.accessioned	2017-06-27T01:06:16Z	-
dc.date.available	2017-06-27T01:06:16Z	-
dc.date.issued	2016	-
dc.identifier.issn	0166-218X	-
dc.identifier.other	OAK-18724	-
dc.identifier.uri	https://dspace.ewha.ac.kr/handle/2015.oak/235373	-
dc.description.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.	-
dc.language	English	-
dc.publisher	Elsevier	-
dc.subject	Dynamic coloring	-
dc.subject	Four color theorem	-
dc.subject	Hadwiger's conjecture	-
dc.subject	Minor-free graph	-
dc.title	Dynamic coloring of graphs having no K5 minor	-
dc.type	Article in Press	-
dc.relation.index	SCIE	-
dc.relation.index	SCOPUS	-
dc.relation.journaltitle	Discrete Applied Mathematics	-
dc.identifier.doi	10.1016/j.dam.2016.01.022	-
dc.identifier.wosid	WOS:000376542600009	-
dc.identifier.scopusid	2-s2.0-84975701844	-
dc.author.google	Kim Y.	-
dc.author.google	Lee S.J.	-
dc.author.google	Oum S.-I.	-
dc.contributor.scopusid	김연진(55574123179)	-
dc.date.modifydate	20210915164223	-