A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
ON THE SIMPLICITY OF THE CODED PATH OF THE CODE (i)
2014
Communications of the Korean Mathematical Society
Preserved Fulltext
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.
doi:10.4134/ckms.2014.29.1.213
fatcat:kvc25lcj65htbnd43db4hxohqa