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

DOI10.4134/CKMS.2014.29.1.213MaRDI QIDQ5408175zbMATH OpenFDO

Authors Dal-Young Jeong, Jeong Suk Son

Publication date 9 April 2014

Published in Communications of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4134/CKMS.2014.29.1.213

zbMATH Keywords

coded pathmulti 2-gonal graphsuniversally simple

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Recommendations

• A structural property of convex 3-polytopes
• Two Classes of Simple MCD Graphs
• Ensembles libres de chemins dans un graphe
• A clique-difference encoding scheme for labelled \(k\)-path graphs
• Coding sequences and Euler's formula for graphs on surfaces

This page was built for publication: On the simplicity of the coded path of the code \((i)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5408175)