Dynamic coloring of graphs having no K-5 minor

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 217
  • Download : 0
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 5.-J. Kim, W.J. Park and the second author [Discrete Appl. Math. 161 (2013) 2207-22121. (C) 2016 Elsevier B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2016-06
Language
English
Article Type
Article
Citation

DISCRETE APPLIED MATHEMATICS, v.206, pp.81 - 89

ISSN
0166-218X
DOI
10.1016/j.dam.2016.01.022
URI
http://hdl.handle.net/10203/209723
Appears in Collection
MA-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0