상세 보기
초록
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. © 2014 The Korean Mathematical Society.
키워드
Coded path; Multi 2-gonal graphs; Universally simple
- 제목
- On the simplicity of the coded path of the code (i)
- 저자
- Jeong, D.Y.; Son, J.S.
- 발행일
- 2014
- 유형
- Article
- 저널명
- 대한수학회논문집
- 권
- 29
- 호
- 1
- 페이지
- 213 ~ 218