Shortness parameters for polyhedral graphs

DOI10.1016/S0012-365X(98)00402-6zbMath0932.05047OpenAlexW2085204654MaRDI QIDQ1304819

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

pathscyclescircumferencepolyhedral graphs

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (3)

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

This page was built for publication: Shortness parameters for polyhedral graphs