View : 18 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
김연진
Issue Date
2016
Journal Title
Discrete Applied Mathematics
ISSN
0166-218XJCR Link
Keywords
Dynamic coloringFour color theoremHadwiger's conjectureMinor-free graph
Publisher
Elsevier
Indexed
SCI; SCIE; SCOPUS WOS scopus
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


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE