Longest cycles in polyhedral graphs

DOI10.1007/BF02764642zbMATH Open0784.05059OpenAlexW1975980926MaRDI QIDQ690053FDOQ690053

Authors: Hansjoachim Walther 

Publication date: 17 March 1994

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02764642

Recommendations

• Some new results about the shortness exponent in polyhedral graphs
• Publication:5753980
• Shortness parameters for polyhedral graphs
• Shortness parameters for planar graphs with faces of only one type
• scientific article; zbMATH DE number 889955

zbMATH Keywords

polyhedral graphsshortness exponent

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Paths and cycles (05C38) Graph theory (05C99)

Cites Work

• Shortness exponents of families of graphs
• Longest Simple Paths in Polyhedral Graphs
• On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles
• Regular planar graphs with faces of only two types and shortness parameters
• On shortness exponents of families of graphs

Cited In (10)

• Title not available (Why is that?)
• The longest cycle problem is polynomial on interval graphs
• Finding paths and cycles of superpolylogarithmic length
• Title not available (Why is that?)
• Determinants and Longest Cycles of Graphs
• On short cycles through prescribed vertices of a polyhedral graph
• Regular planar graphs with faces of only two types and shortness parameters
• On longest cycles and strongly linking vertex sets
• Lattice graphs with non-concurrent longest cycles
• Some new results about the shortness exponent in polyhedral graphs

This page was built for publication: Longest cycles in polyhedral graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690053)