On the simplicity of the coded path of the code ($i$)

Dal Young Jeong; Jeong Suk Son

doi:10.4134/CKMS.2014.29.1.213

Article

HOME

ALL ARTICLES

View

Commun. Korean Math. Soc. 2014; 29(1): 213-218

Printed January 31, 2014

https://doi.org/10.4134/CKMS.2014.29.1.213

On the simplicity of the coded path of the code ($i$)

Dal Young Jeong and Jeong Suk Son

Soongsil University, Soongsil University

Abstract

Go to

Abstract

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.

Keywords: coded path, universally simple, multi 2-gonal graphs

MSC numbers: 05C10, 05C38, 52C30