Shortness parameters for polyhedral graphs
For a family \({\mathcal F}\) of graphs the following shortness parameters are introduced: \[ \begin{aligned} \sigma ({\mathcal F}) & = \liminf_{G\in{\mathcal F}} \bigl\{\log h(G)/ \log n(G)\bigr\}, \\ \rho({\mathcal F}) & = \liminf_{G\in{\mathcal F}} \bigl\{h(G)/n(G)\},\\ \tau({\mathcal F}) & = \sup_{G\in {\mathcal F}}\bigl(n(G)-h(G)\bigr), \end{aligned} \] where \(n(G)\) is the order of \(G\) and \(h(G)\) is the circumference of \(G\). The author studies the above three parameter for various classes of polyhedral graphs. A number of known and new results are presented, and several conjectures are formulated.
- Some new results about the shortness exponent in polyhedral graphs
- scientific article; zbMATH DE number 867634
- Shortness parameters for planar graphs with faces of only one type
- Shortness coefficients of simple 3-polytopal graphs with edges of only two types
- On short cycles through prescribed vertices of a polyhedral graph
- scientific article; zbMATH DE number 4016935
- Bipartite regular graphs and shortness parameters
- A lower bound for the shortness coefficient of a class of graphs
- scientific article; zbMATH DE number 889955
- scientific article; zbMATH DE number 2208641
- On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles
- Long paths and toughness of \(k\)-trees and chordal planar graphs
- An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs
- Regular non-Hamiltonian polyhedral graphs
- Shortness parameters for planar graphs with faces of only one type
- scientific article; zbMATH DE number 867634 (Why is no real title available?)
- Longest cycles in polyhedral graphs
This page was built for publication: Shortness parameters for polyhedral graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1304819)
