All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6 (Q2334769): Difference between revisions

For a graph \(G = (V, E)\), let \(\delta(G)\) be the minimum vertex degree of \(G\) while the girth \(g(G)\) is defined as the length of its shortest cycle. A \(k\)-vertex \(v\) is a vertex of degree \(d(v)=k\). A \(k\)-path is a path with \(k\) vertices while a \(3\)-path \(uvw\) is of type \((i, j, k)\) if \(d(u)\leq i\), \(d(v)\leq j\) and \(d(w)\leq k\). A description of path types is called tight if none of its parameters can be strengthened and no term can be dropped. The main theorem provides tight descriptions of \(3\)-paths for plane graphs \(G\) with \(\delta(G)=2\) and girth \(g(G)\geq 6\). A second theorem provides structural information for the faces of plane graphs \(G\) with \(\delta(G)\geq 3\).