JOURNAL BROWSE
Search
Advanced SearchSearch Tips
ON THE SIMPLICITY OF THE CODED PATH OF THE CODE (i)
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
ON THE SIMPLICITY OF THE CODED PATH OF THE CODE (i)
Jeong, Dal Young; Son, Jeong Suk;
  PDF(new window)
 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;
 Language
English
 Cited by
 References
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.