Planarity of generalized ladder graphs
From MaRDI portal
Publication:6409129
arXiv2208.13637MaRDI QIDQ6409129FDOQ6409129
Suh-Ryung Kim, Homoon Ryu, Hojin Chu
Publication date: 29 August 2022
Abstract: The Cartesian product of P_2 and P_n is called an n-ladder graph for a positive integer n. We call two paths P_m and P_n together with some edges each of which joins a vertex on P_m and a vertex on P_n a generalized (m,n)-ladder graph. In this paper, we completely characterize the planar generalized ladder graphs and the outerplanar generalized ladder graphs. A functigraph C(P_n ,f) is a generalized (n,n)-ladder graph. Consequently, our result solves the problem posed by A. Chen et al. (2011) to characterize planar functigraphs C(P_n ,f).
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
This page was built for publication: Planarity of generalized ladder graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409129)
