• Communications of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.213-218
• /
• 2014

J. Malkevitch defined the coded path in r-valent polytopal graphs of uniform face structure and showed many interesting properties of the coded paths. In this paper, we study the simplicity of coded paths in an m-valent planar multigraph which is not a polytopal graph.