A lower bound for the shortness coefficient of a class of graphs

DOI10.1016/0166-218X(94)90098-1zbMath0803.05019OpenAlexW1998694031MaRDI QIDQ1329808

Jochen Harant, Hansjoachim Walther

Publication date: 2 January 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90098-1

zbMATH Keywords

shortness coefficient\(q\)-gonlongest circuit

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

On cubic polyhedral graphs with prescribed adjacency properties of their faces

Cites Work

• On the simplicial 3-polytopes with only two types of edges
• Simple 3-polytopal graphs with edges of only two types and shortness coefficients
• On a class of Hamiltonian polytopes
• On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles
• Shortness exponents of families of graphs

This page was built for publication: A lower bound for the shortness coefficient of a class of graphs