대한수학회논문집 (Communications of the Korean Mathematical Society)

  • 제29권1호
  • /
  • Pages.213-218
  • /
  • 2014
  • /
  • 1225-1763(pISSN)
  • /
  • 2234-3024(eISSN)
대한수학회 (Korean Mathematical Society)
권호 표지
DOI QR코드

DOI QR Code

ON THE SIMPLICITY OF THE CODED PATH OF THE CODE (i)

  • 투고 : 2013.10.11
  • 발행 : 2014.01.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

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.

키워드

참고문헌

  1. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Elsevier Publishing Co., 1977.
  2. J. Malkevith, Properties of planar graphs with uniform vertex and face structure, Memoirs of the A.M.S., American Mathematical Society, 1970.
  3. G. Chartrand and L. Lensniak, Graphs and Digraphs, Wadsworth and Books, California, 1979.