Shortness parameters for polyhedral graphs

DOI10.1016/S0012-365X(98)00402-6MaRDI QIDQ1304819zbMATH OpenOpenAlexFDO

Authors Peter J. Owens

Publication date 13 March 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(98)00402-6

zbMATH Keywords

pathscircumferencecyclespolyhedral graphs

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• Some new results about the shortness exponent in polyhedral graphs
• Publication:4873747
• 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
• Publication:3029031
• Bipartite regular graphs and shortness parameters
• A lower bound for the shortness coefficient of a class of graphs
• Publication:4882471
• Publication:5691934

Cited in

(7)

• An update on non-Hamiltonian \(\frac{5}{4}\)-tough maximal planar graphs
• Longest cycles in polyhedral graphs
• Shortness parameters for planar graphs with faces of only one type
• Long paths and toughness of \(k\)-trees and chordal planar graphs
• scientific article; zbMATH DE number 867634 (Why is no real title available?)
• On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles
• Regular non-Hamiltonian 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)