Contents

Ars Combinatoria

  • Research article

The Dynamic Coloring Numbers of Pseudo-Halin Graphs

Xianyong Meng1, Lianying Miao2, Bentang Su1, Rensuo Li1
1College of Information Science and| Engineering, Shandong Agriculture University, Taian, Shandong, 27100, China
2College of Science, China University of Mining and Technology, Xuzhou, Jiangsu, 221008, China
  • Published: 30/04/2006

Abstract

In this paper, we have discussed the dynamic coloring of a kind of planar graph. Let \(G\) be a Pseudo-Halin graph, we prove that the dynamic chromatic number of \(G\) is at most \(4\). Examples are given to show the bounds can be attained.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Xianyong Meng, Lianying Miao, Bentang Su, Rensuo Li. The Dynamic Coloring Numbers of Pseudo-Halin Graphs[J], Ars Combinatoria, Volume 079. 3-9. .